Submission #1092645

#	Time	Username	Problem	Language	Result	Execution time	Memory
1092645		alexdd	Peru (RMI20_peru)	C++17	0 / 100	1 ms	348 KiB

peru

#include "peru.h"
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9+7;
const long long INF = 1e18;
long long 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;
        long long mxm=0;
        for(int j=i-1;j>=max(0,i-k);j--)
        {
            mxm = max(mxm, a[j+1]);
            if(j==i-k || a[j]>mxm || 1)
            {
                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

*/

• Subtask 1: 0 / 18
• Subtask 2: 0 / 31
• Subtask 3: 0 / 51