Pagini recente » Diferente pentru problema/antitero intre reviziile 2 si 3 | Cod sursa (job #1044681) | Cod sursa (job #1075193) | Cod sursa (job #1435858) | Cod sursa (job #1389626)
#include <stdio.h>
#include <stdlib.h>
long long v[5000000];
long long deque[100];
long long p,u,n,k;
long long i,min;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++){
scanf("%lld",&v[i]);
}
for(i=1;i<=n;i++){
while(p<=u && v[i]<v[deque[u]]){
u--;
}
deque[++u]=i;
if(i-k==deque[p]){
p++;
}
if(i>=k) min+=v[deque[p]];
}
printf("%lld",min);
return 0;
}