Pagini recente » Cod sursa (job #1797436) | Cod sursa (job #1194100) | Cod sursa (job #2081832) | Cod sursa (job #135499) | Cod sursa (job #2495634)
#include <fstream>
using namespace std;
int n,k;
int val[5000001];
pair <int,int> coada[5000001];
int c,vf;
long long sum;
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
cin>>n>>k;
for(int i=1;i<=n;i++)
cin>>val[i];
c=1;
for(int i=1;i<=k;i++)
{
while(vf>=c && coada[vf].first>=val[i])
vf--;
coada[++vf]={val[i],i};
}
sum=(long long)coada[c].first;
for(int i=k+1;i<=n;i++)
{
while(coada[c].second<=i-k)
c++;
while(vf>=c && coada[vf].first>=val[i])
vf--;
coada[++vf]={val[i],i};
sum+=(long long)coada[c].first;
}
cout<<sum;
}