Pagini recente » Borderou de evaluare (job #473317) | Borderou de evaluare (job #2212482) | Borderou de evaluare (job #2615004) | Borderou de evaluare (job #2207419) | Cod sursa (job #407200)
Cod sursa(job #407200)
#include<stdio.h>
int a[5000002], Deque[5000002];
long long Sum;
int n,k;
void cit();
void rez();
void afis();
int main() {
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
cit();
rez();
afis();
return 0;
}
void cit() {
scanf("%d%d", &n,&k);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
}
void rez() {
int inc=1,sf=0;
for(int i=1; i<=n; i++) {
while(inc<=sf && a[i]<=a[Deque[sf]])
sf--;
Deque[++sf]=i;
if(Deque[inc]==i-k)
inc++;
if(i>=k)
Sum+=a[Deque[inc]];
}
}
void afis() {
printf("%ld", Sum);
}