Pagini recente » Cod sursa (job #916844) | Cod sursa (job #1681756) | Cod sursa (job #677344) | Cod sursa (job #414064) | Cod sursa (job #2059077)
#include <fstream>
using namespace std;
ifstream in ("deque.in");
ofstream out ("deque.out");
const int N = 5000005;
int v[N], deq[N];
long long Suma;
int main()
{
int n, k, i;
in >> n >> k;
for(i = 1; i <= n; i++)
in >> v[i];
int inc = 1, sf = 0;
for(i = 1; i <= n; i++)
{
while(inc <= sf && v[i] <= v[deq[sf]])
sf--;
deq[++sf] = i;
if(deq[inc] == i-k)
inc++;
if(i >= k)
Suma += v[deq[inc]];
}
out << Suma;
return 0;
}