Cod sursa(job #1147772)
Utilizator | denis tdr denis_tdr | Data | 20 martie 2014 09:39:49 |
---|---|---|---|
Problema | Secventa | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
int n, k, v[500005], bMax, a, b;
int main(){
ifstream f("secventa.in");
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
bMax=-30001;
for(int i=1;i<=n-k+1;i++)
{
int unMin=v[i];
for(int j=i;j<=i+k-1;j++)
unMin=min(v[j], unMin);
if(bMax<unMin)
bMax=unMin, a=i, b=i+k-1;
}
ofstream g("secventa.out");
//cout<<a<<" "<<b<<" "<<bMax;
g<<a<<" "<<b<<" "<<bMax;
return 0;
}