Cod sursa(job #632062)
| Utilizator | Data | 10 noiembrie 2011 11:19:18 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<stdio.h>
using namespace std;
int A[5000000],Coada[5000000],n,k;
long long suma;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
int i;
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&A[i]);
int cap=1,spate=0;
for(i=1;i<=n;i++)
{
while(cap<=spate&&A[i]<=A[Coada[spate]])
spate--;
spate++;
Coada[spate]=i;
if(Coada[cap]==i-k)
cap++;
if(i>=k)
suma+=A[Coada[cap]];
}
printf("%lld",suma);
return 0;
}