Cod sursa(job #2260474)
| Utilizator | Data | 15 octombrie 2018 00:29:07 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
#include<deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int n,k,i,v[5000001],suma;
int main()
{
f>>n>>k;
deque<int>coada;
for(i=1;i<=n;i++)
{
f>>v[i];
while(!coada.empty()&&v[i]<v[coada.back()])
coada.pop_back();
coada.push_back(i);
if(coada.front()==i-k)
coada.pop_front();
if(i>=k)
suma=suma+v[coada.front()];
}
g<<suma;
return 0;
}
