Pagini recente » Borderou de evaluare (job #2590999) | Cod sursa (job #1655320) | Cod sursa (job #128561) | Cod sursa (job #1658591) | Cod sursa (job #1315482)
#include <iostream>
#include<fstream>
using namespace std;
int a[5000010],dq[5000010],n,k;
long long sol;
void citire()
{
ifstream fin("deque.in");
fin>>n>>k;
for(int i=1;i<=n;++i)
fin>>a[i];
fin.close();
}
void solve()
{
int pr=-1,ul=0,i;
for(i=1;i<=n;++i)
{
while(pr<=ul && a[i]<=a[dq[ul]])
--ul;
dq[++ul]=i;
if(dq[pr]==i-k)
++pr;
if(i>=k)
sol+=a[dq[pr]];
}
ofstream fout("deque.out");
fout<<sol<<"\n";
fout.close();
}
int main()
{
citire();
solve();
return 0;
}