# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533923 | amunduzbaev | Peru (RMI20_peru) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#define ar array
#define int long long
const int N = 25e5 + 5;
const int mod = 1e9 + 7;
int a[N], dp[N];
signed main(){
ios::sync_with_stdio(0); cin.tie(0);
int n, k; cin>>n>>k;
for(int i=0;i<n;i++) cin>>a[i];
memset(dp, 127, sizeof dp);
for(int i=0;i<n;i++){
int mx = a[i];
for(int j=i-1;j>=max(0ll, i-k);j--){
dp[i] = min(dp[i], dp[j] + mx);
mx = max(mx, a[j]);
}
if(i < k) dp[i] = min(dp[i], mx);
}
int res = 0;
for(int i=0;i<n;i++){
res = (res * 23ll + dp[i]) % mod;
//~ cout<<dp[i]<<" ";
}
//~ cout<<"\n";
cout<<res<<"\n";
}