Cod sursa(job #2888641)
| Utilizator | Data | 11 aprilie 2022 18:12:26 | |
|---|---|---|---|
| Problema | Deque | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#include<iostream>
using namespace std;
ifstream f("deque.in");
ofstream g("deque.out");
int main () {
int v[50001],d[50001]={0},n,k,st=1,dr=0,suma=0;
f>>n>>k;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i = 1; i <=n; i++)
{
while(dr >= st && v[i] <= v[d[dr]]) dr--;
dr++;
d[dr] = i;
if(i >= k)
{
suma+= v[d[st]];
if(d[st] == i - k + 1) {
st++;
}
}
}
g<<suma;
return 0;
}
