Pagini recente » Rating Zahiu Rares (tazzmanian) | Cod sursa (job #784774) | Cod sursa (job #141653) | Cod sursa (job #1164158) | Cod sursa (job #2714064)
#include <fstream>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
const int N = 5000000;
int dq[N], v[N];
int main()
{
int st = 0, dr = -1, k, n, s = 0;
fin >> n >> k;
for(int 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 += v[dq[st]];
}
fout << s;
return 0;
}