Cod sursa(job #251441)
| Utilizator | Data | 2 februarie 2009 17:12:56 | |
|---|---|---|---|
| Problema | Secventa | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<stdio.h>
const int N=500001;
int main()
{
freopen("secventa.in","r",stdin);
freopen("secventa.out","w",stdout);
int v[N],deque[N],start,end,n,k;
int i,f,l,max=-30001;
scanf("%d%d",&n,&k);
for(i=1;i<=n;++i)
scanf("%d",&v[i]);
start=1;
end=0;
for(i=1;i<=n;++i)
{
while(start<=end&&v[deque[end]]>=v[i]) --end;
deque[++end]=i;
if(deque[start]==i-k) ++start;
if(v[deque[start]]>max&&i>=k)
{
max=v[deque[start]];
l=i;
}
}
printf("%d %d %d\n",l-k+1,l,max);
return 0;
}