Pagini recente » Cod sursa (job #2795335) | Cod sursa (job #2916942) | Cod sursa (job #1931161) | Cod sursa (job #1190128) | Cod sursa (job #914706)
Cod sursa(job #914706)
#include <iostream>
#include <fstream>
using namespace std;
long long s;
int n,k,f,b,a[5000010],d[5000010],i;
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
fin>>n>>k;
for(i=1;i<=n;i++)fin>>a[i];
f=1;
for(i=1;i<=n;i++)
{
while((f<=b)&&(a[i]<=a[d[b]]))b--;
b++;
d[b]=i;
if(d[f]==i-k)f++;
if(i>=k)s+=a[d[f]];
}
// for(i=1;i<=f;i++)s+=a[d[i]];
// cout<<sizeof(a+d);
fout<<s;
fin.close();
fout.close();
return 0;
}