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;
long long a,b,c,d,e,i,j,ii,jj,zx,xc,k,f[2500009],dp[2500009],mod=1000000007LL,xr[2500009],pas;
int PAS;
int solve(int nn, int kk, int* vv){
a=nn;k=kk;
for(i=1; i<=a; i++){
f[i]=(*vv);if(i!=a) vv++;
}
xr[0]=1;
for(i=1; i<=a+1; i++){
xr[i]=xr[i-1]*23;xr[i]%=mod;
}
dp[0]=0;
for(i=1; i<=a; i++){
dp[i]=dp[i-1]+f[i];zx=f[i];
for(j=i-1; j>=0; j--){
if(i-j>k) break;
zx=max(zx,f[j+1]);
dp[i]=min(dp[i],dp[j]+zx);
}
}
for(i=1; i<=a; i++){
pas+=dp[i]*xr[a-i];pas%=mod;
}
PAS=pas;return PAS;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |