Pagini recente » Cod sursa (job #2605440) | Cod sursa (job #1265837) | Cod sursa (job #1396554) | Cod sursa (job #168544) | Cod sursa (job #2018178)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long int n,k,i,v[5000001],deq[5000001],stanga,dreapta,sum;
int main()
{
fin >> n >> k;
stanga=1;
for(i=1;i<=n;i++)
{
fin >> v[i];
while(stanga<=dreapta and v[i]<=v[deq[dreapta]])
{
dreapta--;
}
dreapta++;
deq[dreapta]=i;
if(deq[stanga]==i-k)
{
stanga++;
}
if(i>=k)
{
sum+=v[deq[stanga]];
}
}
fout << sum;
return 0;
}