Pagini recente » Cod sursa (job #2905836) | Cod sursa (job #686566) | Cod sursa (job #2298146) | Cod sursa (job #10555) | Cod sursa (job #944995)
Cod sursa(job #944995)
#include <iostream>
#include <fstream>
#define inf 9999999
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int a[5100000],b[5100000];
int st=1,dr,k;
inline void stanga(int i)
{
while(b[st]==i-k)st++;
}
inline void dreapta(int i)
{
while(st<=dr && a[i]<=a[b[dr]])
dr--;
}
int main()
{
long long i,j,n,m,k,s=0;
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=n;i++)
{
if(i>k)stanga(i);
dreapta(i);
dr++;
b[dr]=i;
if(i>=k)s+=a[b[st]];
}
fout<<s;
}