Pagini recente » Cod sursa (job #1406422) | Cod sursa (job #58841) | Cod sursa (job #1672413) | Cod sursa (job #49151) | Cod sursa (job #243482)
Cod sursa(job #243482)
#include <stdio.h>
int A[5000001],q[5000001];
int main()
{
FILE *in = fopen("deque.in","r");
FILE *out = fopen("deque.out","w");
int m,n,p,u,i;
fscanf(in,"%d%d",&n,&m);
for (i=1;i<=n;i++) fscanf(in,"%d",&A[i]);
u=0;
p=1;
long long S = 0;
for (i=1;i<=n;i++)
{
while (p<=u && A[i]<A[q[u]]) u--;
q[++u] = i;
if (i-m==q[p]) p++;
if (i>=m) S = S+A[q[p]];
}
fprintf(out,"%lld",S);
}