Pagini recente » Cod sursa (job #899465) | Cod sursa (job #914899) | Cod sursa (job #1653483) | Cod sursa (job #2629195) | Cod sursa (job #1560847)
# include <cstdio>
# include <deque>
# define N 5000010
using namespace std;
deque <int> q;
int n,lg,a[N];
long long S;
int main()
{
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
scanf("%d %d\n", &n, &lg);
for(int i=1; i<=n; ++i)
{
scanf("%d\n", &a[i]);
while(q.size() && a[q.back()]>=a[i]) q.pop_back();
q.push_back(i);
if(i>=lg) S+=a[q.front()];
if(q.front()==i-lg+1) q.pop_front();
}
printf("%lld\n", S);
}