Pagini recente » Cod sursa (job #859933) | Cod sursa (job #686427) | Cod sursa (job #1652848) | Cod sursa (job #78432) | Cod sursa (job #2999596)
#include <iostream>
#include <fstream>
using namespace std;
int a[5000001],q[5000001];
ifstream fin("deque.in");
ofstream fout("deque.out");
int main()
{
int n,k,pq=0,uq=-1,i;
long long s=0;
fin>>n>>k;
for(i=1;i<k;i++)
{
fin>>a[i];
while(pq<=uq && a[i]<=a[q[uq]])uq--;
q[++uq]=i;
}
for(i=k;i<=n;i++)
{
fin>>a[i];
while(pq<=uq && a[i]<=a[q[uq]])uq--;
q[++uq]=i;
if(q[pq]<=i-k)pq++;
s+=a[q[pq]];
}
fout<<s;
return 0;
}