Cod sursa(job #390775)
| Utilizator | Data | 4 februarie 2010 15:38:48 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
using namespace std;
FILE *f=fopen("deque.in","r");
FILE *g=fopen("deque.out","w");
int v[500001],c[500001];
int n,k;
long long i,s,u,p;
int main(){
fscanf(f,"%d%d",&n,&k);
for(i=1;i<=n;i++)
fscanf(f,"%lld",&v[i]);
p=1; u=0;
for(i=1;i<=n;i++){
while(p<=u && v[i] <= v[c[u]] )
u--;
u++;
c[u]=i;
if(c[p]==i-k)
p++;
if (i>=k)
s+=v[c[p]];
}
fprintf(g,"%lld",s);
return 0;
}