Pagini recente » Cod sursa (job #408285) | Cod sursa (job #2196409) | Cod sursa (job #2469570) | Cod sursa (job #1617917) | Cod sursa (job #783842)
Cod sursa(job #783842)
#include<fstream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long n,m,i,s,k,li,ls,a[5000001];
int d[5000001];
int main()
{f>>n>>k;
for(i=1;i<=n;++i)
f>>a[i];
li=0;
ls=1;
for(i=1;i<=n;++i)
{while(li>=ls&&a[i]<=a[d[li]])--li;
d[++li]=i;
if(d[ls]==i-k)
++ls;
if(i>=k)
s+=a[d[ls]];
}
g<<s<<'\n';
return 0;
}