Cod sursa(job #1630070)
Utilizator | Data | 4 martie 2016 21:45:44 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,a[500001];
ifstream f("secventa.in");
ofstream g("secventa.out");
int main()
{int p,i,min=30001,max=-30001,j;
f>>n>>k;
for(i=1;i<=n;i++)f>>a[i];
min=a[n];j=1;
for(i=n-1;i>=1;i--)
{if(a[i]<min){min=a[i];j=1;}
else if(j<k){a[i]=min;j++;}
else {min=a[i];j=1;}
if(i<=n-k+1&&min>max){max=min;p=i;}
}
g<<p<<" "<<p+k-1<<" "<<max;
return 0;
}