Cod sursa(job #2811385)
Utilizator | Filip Gruianu Filipppp | Data | 2 decembrie 2021 09:55:45 |
---|---|---|---|
Problema | Deque | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <cstdio>
#include <iostream>
using namespace std;
const int N=5000000+7;
int n,k,a[N];
signed main() {
freopen ("deque.in","r",stdin);
freopen ("deque.out","w",stdout);
scanf("%d%d",&n,&k);
for (int i=1;i<=n;i++){
scanf("%d",&a[i]);
}
long long sum=0;
for (int i=k;i<=n;i++){
int mn=a[i];
for (int j=i-k+1;j<=i;j++){
mn=min(mn,a[j]);
}
sum+=mn;
}
printf("%lld\n",sum);
return 0;
}
/**
**/