Cod sursa(job #1608148)
| Utilizator | Data | 21 februarie 2016 21:13:35 | |
|---|---|---|---|
| Problema | Secventa | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.58 kb |
#include <cstdio>
#define longn 5000005
using namespace std;
int v[longn],deq[longn];
int n,k;
long long s;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for (int i=1;i<=n;++i)
scanf("%d",&v[i]);
int Front=1,Back=0;
for (int i=1;i<=n;++i)
{
while (Front<=Back && v[i]<=v[deq[Back]])
--Back;
deq[++Back]=i;
if (deq[Front]==i-k)
Front++;
if (i>=k)
s+=v[deq[Front]];
}
printf("%lld",s);
return 0;
}
