Pagini recente » Cod sursa (job #2811132) | Cod sursa (job #544399) | Cod sursa (job #1984159) | Cod sursa (job #1582985) | Cod sursa (job #1117361)
#include<cstdio>
using namespace std;
#define MAX 5000001
int N ,K, v[MAX] , d[MAX] , l , r;
long long s;
int main()
{
freopen("deque.in" , "r" , stdin );
scanf("%d%d" , &N , &K );
for(int i = 1 ; i <= N ; ++i )
scanf("%d" , &v[i]);
l = 1;
for(int i = 1 ; i<= N ; ++i )
{
while(l <= r && v[i] <= v[d[r]])r--;
d[++r] = i;
if(d[l] == i-K)l++;
if(i >= K)
s+=v[d[l]];
}
freopen("deque.out" , "w" , stdout );
printf("%lld" , s);
return 0;
}