Cod sursa(job #2469851)
| Utilizator | Data | 8 octombrie 2019 09:16:52 | |
|---|---|---|---|
| Problema | Deque | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
#include <deque>
using namespace std;
FILE* in=fopen("deque.in.in", "r");
FILE* out=fopen("deque.in.out", "w");
deque<pair<int, int> > d;
int main()
{
int n, k;
fscanf(in, "%d%d", &n, &k);
int x;
fscanf(in, "%d", &x);
d.push_back(make_pair(x, 1));
int sum=0;
for(int i=2; i<=n; ++i)
{
fscanf(in, "%d", &x);
while(d.back().first>=x) d.pop_back();
d.push_back(make_pair(x, i));
while(d.front().second+k-1<i) d.pop_front();
if(i>=k) sum+=d.front().first;
}
fprintf(out, "%d", sum);
}