# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858851 | alexdumitru | Peru (RMI20_peru) | C++14 | 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 int long long
int getAns(int dp[], int n)
{
int mul = 1;
int ans = 0;
const int MOD = 1e9 + 7;
for(int i = n - 1; i >= 0; i--)
{
ans = (1LL * ans + 1LL * dp[i] * mul) % MOD;
mul = (1LL * mul * 23) % MOD;
}
return ans;
}
int solve(int n, int k, int *s)
{
int dp[n + 2];
int Max = 0;
for(int i = 0; i < k; i++)
{
if(s[i] > Max)
Max = s[i];
dp[i] = Max;
}
for(int i = k; i < n; i++)
{
int currMax = s[i];
dp[i] = LLONG_MAX;
for(int j = i - 1; j >= i - k; j--)
{
if(dp[i] > dp[j] + currMax)
dp[i] = dp[j] + currMax;
if(s[j] > currMax)
currMax = s[j];
}
}
return getAns(dp, n);
}