Pagini recente » Cod sursa (job #833963) | Cod sursa (job #704079) | Cod sursa (job #1196930) | Cod sursa (job #1861748) | Cod sursa (job #2719231)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<ctype.h>
#include<cmath>
#include<fstream>
using namespace std;
ifstream fin("tester2021.in");
ofstream fout("tester2021.out");
const int N = 5000000;
int v[N],dq[N];
int main()
{
int st=0,dr=-1,i,n,k,s=0;
fin>>n>>k;
for(i=0;i<n;i++)
{
fin >> v[i];
if(st<=dr && dq[st]==i-k)
st++;
while(st<=dr && v[i]<=v[dq[dr]])
dr--;
dq[++dr]=i;
if(i>=k-1)
s=s+v[dq[st]];
}
fout<<s;
return 0;
}