Cod sursa(job #813421)
Utilizator | Vlad Dimulescu vladvaldez | Data | 15 noiembrie 2012 15:09:47 |
---|---|---|---|
Problema | Deque | Scor | 25 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <stdio.h>
using namespace std;
FILE *f=fopen("deque.in","r");
FILE *g=fopen("deque.out","w");
int v[5000000],a[5000000],i,n,k,b,p;
long long s;
int main()
{
fscanf(f,"%d%d",&n,&k);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
p=1;
b=0;
for(i=1;i<=n;i++)
{
while(p<=b && v[i]<=v[a[b]])b--;
b++;
a[b]=i;
if (a[p]==i-k)p++;
if(i>=k)s=s+v[a[p]];
}
fprintf(g,"%d",s);
fclose(g);
return 0;
}