Cod sursa(job #2731765)
| Utilizator | Data | 28 martie 2021 11:13:02 | |
|---|---|---|---|
| Problema | Deque | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int N,K,i,st=0,dr=-1,c[5000001];
long long suma=0;
int main(){
ifstream f("deque.in");
ofstream g("deque.out");
f>>N>>K;
int *v= new int[N];
for (i=0;i<N;i++) f>>v[i];
for (i=0;i<N;i++)
{
while (st<=dr && v[i]<=v[c[dr]])
dr--;
dr++;
c[dr]=i;
if (c[st]==i-K) st++;
if (i+1>=K) suma=suma+v[c[st]];
}
g<<suma;
delete []v;
f.close();
g.close();
return 0;
}