# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1092642 | alexdd | Peru (RMI20_peru) | C++17 | 1 ms | 344 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 "peru.h"
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9+7;
const int INF = 1e18;
int a[2500005];
long long dp[2500005];
int solve(int n, int k, int* v)
{
a[0]=2e9+2;
for(int i=1;i<=n;i++)
{
a[i]=v[i-1];
dp[i]=INF;
int mxm=0;
for(int j=i-1;j>=i-k;j--)
{
mxm = max(mxm, a[j+1]);
if(j==i-k || a[j]>mxm)
{
dp[i] = min(dp[i], dp[j]+mxm);
}
}
}
long long rez=0,put23=1;
for(int i=n;i>0;i--)
{
rez = (rez + put23*dp[i])%MOD;
put23 = put23*23LL%MOD;
}
return rez;
}
/*
8 3
3 2 9 8 7 11 3 4
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |