Cod sursa(job #2447185)
| Utilizator | Data | 12 august 2019 12:55:48 | |
|---|---|---|---|
| Problema | Deque | Scor | 60 |
| Compilator | cpp-32 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include<deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int v[500001];
deque<int> a;
int n,k;
long long suma;
int main()
{
fin>>n>>k;
for(int i = 1;i <= n;i++)
fin>>v[i];
for(int i = 1;i <= n;i++)
{
while(!a.empty() && v[i] <= v[a.back()]) a.pop_back();
a.push_back(i);
if(a.front() == i - k) a.pop_front();
if(i >= k) suma += v[a.front()];
}
fout<<suma;
return 0;
}
