Cod sursa(job #2942005)
Utilizator | Enache Andrei Alexandru TheAndrei | Data | 18 noiembrie 2022 18:02:13 |
---|---|---|---|
Problema | Deque | Scor | 45 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.81 kb |
#include <iostream>
#include <fstream>
#define nMax 5000001
using namespace std;
ifstream fin("deque.in");
ofstream fout("deque.out");
int v[nMax];
int main()
{
int n, k, min, minIndex=-1, nk, ik;
long long s=0;
fin>>n>>k;
for(int i=1; i<=n; i++)
fin>>v[i];
nk=n-k+1;
for(int i=1; i<=nk; i++){
if(i>minIndex){
min=10000000;
ik=i+k-1;
for(int j=i; j<=ik; j++){
if(v[j]<=min){
min=v[j];
minIndex=j;
}
}
s+=min;
}
else{
if(v[i+k-1]<=min){
min=v[i+k-1];
minIndex=i+k-1;
}
s+=min;
}
}
fout<<s;
return 0;
}