Cod sursa(job #2375098)
| Utilizator | Data | 7 martie 2019 22:17:21 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
#include <deque>
using namespace std;
deque <int>q;
int n, k;
int a[5000005], s;
int main()
{
freopen("deque.in", "r", stdin);
freopen("deque.out", "w", stdout);
scanf("%d %d", &n, &k);
for(int i=1;i<=n;i++)
scanf("%d", &a[i]);
for(int i=1;i<=n;i++)
{
while(!q.empty() && a[i]<=a[q.back()])
q.pop_back();
q.push_back(i);
while(!q.empty() && q.front()<=i-k)
q.pop_front();
if(i>=k)
s+=a[q.front()];
}
printf("%d", s);
return 0;
}
