Pagini recente » Cod sursa (job #653035) | Cod sursa (job #2431178) | Cod sursa (job #682120) | Istoria paginii runda/1235/clasament | Cod sursa (job #3128358)
#include <iostream>
#include <fstream>
using namespace std;
int v[5000001],rez[5000001];
int main()
{
int n,k;
long int suma=0;
int s=0, d=0;
ifstream f("deque.in");
ofstream g("deque.out");
f>>n>>k;
for(int i=0;i<n;i++)
{
f>>v[i];
}
for(int i=0;i<n;i++)
{
while(s<=d && v[i]<= v[rez[d]])
{
d--;
}
d++;
rez[d]=i;
if(rez[s] == i-k)
{
s++;
}
if(i+1>=k)
{
suma += v[rez[s]];
}
}
g<<suma;
f.close();
g.close();
return 0;
}