Pagini recente » Monitorul de evaluare | Diferente pentru problema/expand intre reviziile 37 si 36 | Atasamentele paginii Secvmin | Atasamentele paginii Secvmin | Cod sursa (job #2636431)
//#include <iostream>
#include <fstream>
using namespace std;
long long n,a[5000005],dq[5000005],i,mn=10000000,s,j,k,st,dr;
ifstream cin("deque.in");
ofstream cout("deque.out");
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
cin>>a[i];
dr=1; st=0;
for(i=1;i<=n;i++)
{
while(dr<=st &&a[i]<=a[dq[st]])
{
st--;
}
dq[++st]=i;
if(dq[dr]==i-k)
dr++;
if(i>=k)
s=s+a[dq[dr]];
}
cout<<s;
return 0;
}