Cod sursa(job #431889)
Utilizator | Buleandra Cristian Cristy94 | Data | 1 aprilie 2010 16:00:49 |
---|---|---|---|
Problema | Secventa | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include<fstream.h>
ifstream f("secventa.in");
ofstream g("secventa.out");
int n,k,i,a[500001],minim,d[500001],u,p,pf;
int main(){
f>>n>>k;
minim=-30001;
p=u=1;
d[p]=1;
f>>a[1];
for(i=2;i<=n;i++)
{ f>>a[i];
while(i-d[p]>=k&&p<=u)
p++;
while(a[i]<=a [d[u]]&&p<=u)
u--;
u++;
d[u]=i;
if(i>=k)
if(minim<a[d[p]]){
minim=a[d[p]];
pf=i;
}
}
g<<pf-k+1<<" "<<pf<<" "<<minim;
return 0;
}