# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493489 | Jeff12345121 | 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>
#define int long long
#define ll int
#include "peru.h"
using namespace std;
const ll nmax = 2005;
const ll P = 1000000007;
ll dp[nmax];
int solve(int N, int K, int* S) {
for (ll i = 1; i <= N; i++) dp[i] = LLONG_MAX;
for (ll i = 1; i <= N; i++) {
ll maxSoFar = -1;
for (ll j = i - 1; j >= 0 && j >= i - K; j--) {
maxSoFar = max(maxSoFar, 1LL * S[j]);
dp[i] = min(dp[i], (dp[j] + maxSoFar));
}
}
int dhs=1, ans=0;
for(int i=N; i>=1; i--)
{
ans+=(dp[i]%P*dhs)%P;
ans%=P;
dhs=(dhs*23)%P;
}
return ans;
}