Cod sursa(job #2047184)
Utilizator | miruna mirunaF | Data | 24 octombrie 2017 17:11:55 |
---|---|---|---|
Problema | Deque | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include<fstream>
using namespace std;
const long long N =5000001;
ifstream in("deque.in");
ofstream out("deque.out");
long long d[N],v[N],sum;
int main()
{
long long n,k,i,st=0,dr=-1;
in>>n>>k;
for(i=0; i<n; i++)
{
in>>v[i];
if(st<=dr && d[st] == i-k)
{
st++;
}
while( st<= dr && v[i] <= v[d[dr]])
{
dr--;
}
d[++dr]=i;
if(i>=k-1)
sum+=v[d[st]];
}
out<<sum;
return 0;
}