Cod sursa(job #2662277)
Utilizator | Doroftei Rares rares22iunie | Data | 23 octombrie 2020 19:23:25 |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <cstdio>
#include <deque>
using namespace std;
deque <int>dq;
int n,k,i;
long long sum,a[5000003];
int main()
{
freopen("deque.in","r",stdin);
freopen("deque.out","w",stdout);
scanf("%d %d",&n,&k);
for(i=1;i<=n;i++)
scanf("%lld",&a[i]);
dq.push_back(1);
for(i=2;i<=n;i++)
{
while(!dq.empty() && a[dq.back()]>=a[i])
dq.pop_back();
dq.push_back(i);
while(!dq.empty() && dq.front()<i-k+1)
dq.pop_front();
if(i>=k)
sum+=a[dq.front()];
}
printf("%lld",sum);
return 0;
}