Cod sursa(job #1643761)
| Utilizator | Data | 9 martie 2016 20:09:42 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <cstdio>
using namespace std;
int v[5000010],q[5000010];
int main()
{
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
int n,k,st=1,dr=0;
long long sol=0;
scanf("%d%d",&n,&k);
for(int i=1;i<=n;i++) scanf("%d",&v[i]);
for(int i=1;i<=n;i++)
{
while(st<=dr && v[q[dr]]>=v[i]) dr--;
q[++dr]=i;
if(q[st]<=i-k) st++;
if(i>=k) sol+=v[q[st]];
}
printf("%lld",sol);
return 0;
}
