Cod sursa(job #2732515)
| Utilizator | Data | 28 martie 2021 23:49:19 | |
|---|---|---|---|
| Problema | Deque | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("deque.in");
ofstream out("deque.out");
int v[5000010], aux[5000010]={0};
int main()
{ int n,k,s=0,i,start=1, sfarsit=0;
in>>n>>k;
for(i=1; i<=n; i++){
in>>v[i];
while(start<=sfarsit && v[i]<=v[aux[sfarsit]]){
sfarsit--;
}
sfarsit++;
aux[sfarsit]=i;
if(aux[start]==i-k) start++;
if(i>=k)
s=s+v[aux[start]];
}
out<<s;
in.close();
out.close();
return 0;
}
