Cod sursa(job #1982270)
Utilizator | Data | 18 mai 2017 00:13:40 | |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
const int N=5000001;
int st=1, dr , d[N], v[N],k,n;
int main()
{
long long i,S=0;
cin>>n>>k;
for(i=1; i<=n; i++)
cin>>v[i];
for(i=1; i<=n; i++)
{
while (st <= dr && v[i] <= v[d[dr]])
{
dr--;
}
d[++dr] = i;
if (d[st] == i - k)
{
++st;
}
if(i>=k)
S=S+v[d[st]];
}
cout<<S;
return 0;
}