Cod sursa(job #3143859)
Utilizator | Data | 2 august 2023 16:39:27 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k,a[5000005],i,s;
deque<int> m;
int main()
{
cin>>n>>k;
for(i=1;i<=n;i++)
{
cin>>a[i];
}
m.push_back(1);
for(i=2;i<=k;i++)
{
while(!m.empty()&&a[i]<=a[m.back()])m.pop_back();
m.push_back(i);
}
s+=a[m.front()];
for(i=k+1;i<=n;i++)
{
while(!m.empty()&&m.front()+k<=i)m.pop_front();
while(!m.empty()&&a[i]<=a[m.back()])m.pop_back();
m.push_back(i);
s+=a[m.front()];
}
cout<<s;
return 0;
}