Cod sursa(job #332944)
| Utilizator | Data | 21 iulie 2009 00:47:27 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<cstdio>
#define N 5000
int n,v[N],d[N],s,u,p,k;
void citire()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for (int i=1; i<=k; ++i)
{
scanf("%d",&v[i]);
while (v[i]<=v[d[u-1]]&&u!=p)
--u;
d[u++]=i;
}
s+=v[d[p]];
for (int i=k+1; i<=n; ++i)
{
scanf("%d",&v[i]);
int g=i-d[p];
if (g==k)
++p;
while (u!=p&&v[i]<=v[d[u-1]])
--u;
d[u++]=i;
s+=v[d[p]];
}
printf("%d",s);
}
int main()
{
citire();
return 0;
}
