Cod sursa(job #3220216)
Utilizator | Balasescu Tudor tudoor_balasescu | Data | 2 aprilie 2024 20:51:05 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
long long n,k,i,s,v[5000001];
deque <int> d;
int main()
{
fin>>n>>k;
for(i=1;i<=n;i++)
fin>>v[i];
for(i=1;i<=k;i++)
{
while(!d.empty() && v[d.back()]>v[i])
d.pop_back();
d.push_back(i);
}
s=v[d.front()];
for(i=k+1;i<=n;i++)
{
if(d.front()==i-k)
d.pop_front();
while(!d.empty() && v[d.back()]>v[i])
d.pop_back();
d.push_back(i);
s+=v[d.front()];
}
fout<<s;
return 0;
}