Cod sursa(job #2290033)
Utilizator | Data | 25 noiembrie 2018 18:02:35 | |
---|---|---|---|
Problema | Deque | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int t[5000001],v[5000001];
int main()
{
ifstream fin("deque.in");
ofstream fout("deque.out");
long long suma=0;
int N,K,i,a=0,b=-1;
fin>>N>>K;
for(i=0;i<=N-1;i++)
{
fin>>v[i];
if(a<=b && t[a]==i-K)
{
a++;
}
while(a<=b && v[i]<=v[t[b]])
{
b--;
}
t[++b]=i;
if(i>=K-1)
{
suma=suma+v[t[a]];
}
}
fout<<suma;
fin.close();
fout.close();
return 0;
}