Cod sursa(job #1613790)
Utilizator | Data | 25 februarie 2016 17:17:15 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<cstdio>
using namespace std;
int n,m,v[5000002],dec[5000002],p,u,i;
long long s;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)scanf("%d",&v[i]);
p=1;
for(i=1;i<=n;i++)
{
while(p<=u && v[i] <= v[dec[u]])u--;
u++;
dec[u]=i;
if(dec[p] == i-m)p++;
if(i>=m)s+=v[dec[p]];
}
printf("%lld",s);
}