Cod sursa(job #2402364)
Utilizator | Georgescu Dan cameleon | Data | 10 aprilie 2019 17:10:40 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
long long n,k,i,x,sum,j;
int a[5000020];
deque < int > v;
int main()
{
f>>n>>k;
for(i=1;i<=k;i++)
{
f>>a[i];
while(!v.empty()&&a[v.back()]>=a[i])
v.pop_back();
v.push_back(i);
}
sum+=a[v.front()];
for(i=k+1;i<=n;i++)
{
f>>a[i];
while(!v.empty()&& a[v.back()]>=a[i] )
v.pop_back();
while(!v.empty()&& v.front()<=i-k)
v.pop_front();
v.push_back(i);
sum+=a[v.front()];
}
g<<sum;
}