Pagini recente » Cod sursa (job #2443859) | Cod sursa (job #2548790) | Istoria paginii runda/cerculdeinfo-lectia5-paduri.heap.aib | Cod sursa (job #1315044) | Cod sursa (job #2037408)
#include <iostream>
#include <cstdio>
#include <deque>
using namespace std;
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
deque<int>D;
int x[5000000],n,k;
long long s;
scanf("%d %d\n",&n,&k);
for(int i=0; i<n; i++)
scanf("%d\n",x[i]);
for(int i=0; i<k; i++)
{
while(!D.empty()&&x[i]<x[D.back()])
{
D.pop_back();
}
D.push_back(i);
}
s=s+D.front();
for(int i=k; i<n; i++)
{
if(i-k==D.front())
D.pop_front();
while(!D.empty()&&x[i]<x[D.back()])
{
D.pop_back();
}
D.push_back(i);
s=s+D.front();
}
printf("%lld ",s);
return 0;
}