Pagini recente » Cod sursa (job #16565) | Solutii preONI 2008, Runda 1 | Cod sursa (job #930573) | Cod sursa (job #1892729) | Cod sursa (job #625899)
Cod sursa(job #625899)
#include <stdio.h>
int N,K,A[5000000],Deque[5000000],start=1,end=0;
long long suma;
void deque()
{
for(int i=1;i<=N;i++)
{
while(start<=end && A[i]<=A[Deque[end]])
end--;
Deque[++end]=i;
if(Deque[end]-Deque[start]==K)
start++;
if(i>=K)
suma+=A[Deque[start]];
}
}
int main()
{
FILE *R,*W;
R=fopen("deque.in","r");
W=fopen("deque.out","w");
fscanf(R,"%d",&N);
fscanf(R,"%d",&K);
for(int i=1;i<=N;i++)
fscanf(R,"%d",&A[i]);
deque();
fprintf(W,"%lld",suma);
fclose(R);
fclose(W);
return 0;
}