Pagini recente » Cod sursa (job #458365) | Borderou de evaluare (job #996952) | Cod sursa (job #805184) | Cod sursa (job #1605630) | Cod sursa (job #3231012)
#include <fstream>
#include <deque>
using namespace std;
ifstream cin ("deque.in");
ofstream cout ("deque.out");
int n,k,ans,v[5000005],i;
deque<int>q;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>k;
ans=0;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=n;i++)
{
while(!q.empty() && v[q.front()]>=v[i])
q.pop_front();
q.push_front(i);
while(!q.empty() && i-q.back()+1>k)
q.pop_back();
if(i>=k)
ans+=v[q.back()];
}
cout<<ans;
return 0;
}