Cod sursa(job #2219024)
| Utilizator | Data | 6 iulie 2018 20:52:01 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int v[5000005];
int c[5000005];
int main()
{
int n, k;
in >> n >> k;
int st = 0, dr = -1;
int sum = 0;
for(int i = 0; i < n; i++)
{
in >> v[i];
if(c[st] == i - k)
st++;
while(st <= dr && v[i] <= v[c[dr]])
dr--;
c[++dr] = i;
if(i >= k - 1)
sum += v[c[st]];
}
out << sum;
return 0;
}
