Cod sursa(job #1317116)
| Utilizator | Data | 14 ianuarie 2015 16:27:21 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
using namespace std;
int i,n,k;
int a[5000010],deq[5000010];
int front,back;
long long sum;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.in","r",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
scanf("%d",&a[i]);
front=1;back=0;
for(i=1;i<=n;i++)
{
while(front<=back&&a[i]<=a[deq[back]])back--;
deq[++back]=i;
if(deq[front]==i-k)front++;
if(i>=k)sum+=a[deq[front]];
}
printf("%lld\n",sum);
return 0;
}
