Cod sursa(job #1801889)
| Utilizator | Data | 9 noiembrie 2016 18:11:25 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <deque>
// coment cu 3 slash-uri
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque<pair<int,int>> Q;
long long s;
int n,k,x,i;
int main()
{
f>>n>>k;
for(i=1;i<k;i++)
{
f>>x;
while(Q.size()&&Q.back().first>=x)
Q.pop_back();
Q.push_back(make_pair(x,i));
}
for(i=k;i<=n;i++)
{
f>>x;
while(Q.size()&&Q.back().first>=x)
Q.pop_back();
Q.push_back(make_pair(x,i));
if(Q.front().second==i-k)
Q.pop_front();
s+=Q.front().first;
}
g<<s;
return 0;
}
