Cod sursa(job #1675061)
Utilizator | Data | 5 aprilie 2016 08:34:03 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
deque<int>c;
int n,k,i,s,v[5000001];
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i++)
{
while(v[c.back()]>v[i]&&!c.empty())
{
if(c.size()==0)break;
else c.pop_back();
}
c.push_back(i);
if(c.back()-c.front()>=k){c.pop_front();}
if(i>=k)s=s+v[c.front()];
}
g<<s;
return 0;
}