Pagini recente » Cod sursa (job #690908) | Cod sursa (job #1476329) | Cod sursa (job #1558305) | Cod sursa (job #508689) | Cod sursa (job #2353585)
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long n, k;
struct nr
{
int value;
int poz;
};
nr a[5000001];
int main()
{
int i, pr, ul;
long long s,x;
fin >> n >> k;
//cout<<sizeof(a)/1024.0/1024.0;
fin >> x;
a[1].value = x;
a[1].poz = 1;
pr = ul = 1;
s = 0;
for(i = 2; i <= n; i++)
{
fin >> x;
if(i - a[pr].poz + 1 > k)
pr++;
while(x < a[ul].value && ul >= pr)
ul--;
a[++ul].value = x;
a[ul].poz = i;
if(i > k - 1)
s = 1LL*s + 1LL* a[pr].value;
}
fout << s;
return 0;
}