Submission #636587

#	Time	Username	Problem	Language	Result	Execution time	Memory
636587		stoyan_malinin	Peru (RMI20_peru)	C++14	0 / 100	1 ms	340 KiB

peru

#include "peru.h"
#ifdef _LOCAL_
    #include "grader.cpp"
#endif // _LOCAL_

#include <vector>
#include <deque>

using namespace std;

int rmq(int l, int r, const int *a)
{
    int maxVal = a[l];
    for(int i = l+1;i<=r;i++) maxVal = max(maxVal, a[i]);

    return maxVal;
}

int convertToAns(const vector<long long> &dp)
{
    long long p23 = 1, ans = 0;
    const long long mod = 1e9 + 7;

    for(int i = dp.size()-1;i>=0;i--)
    {
        ans = (ans + (dp[i]%mod)*p23)%mod;
        p23 = (p23*23)%mod;
    }

    return ans;
}

int solve(int n, int k, int* a)
{
    vector <long long> dp(n);

    dp[0] = a[0];
    deque <int> opt;

    long long prefMaxVal = a[0];
    for(int i = 1;i<n;i++)
    {
        while(opt.empty()==false && dp[opt.back()]+rmq(opt.back()+1, i, a)>dp[i-1]+a[i])
        {
            //cout << "pop_back: " << opt.back() << '\n';
            opt.pop_back();
        }
        opt.push_back(i-1);

        while(opt.empty()==false && i-opt.front()>k) opt.pop_front();
        while(opt.size()>=2 && dp[opt[0]]+rmq(opt[0]+1, i, a)>dp[opt[1]]+rmq(opt[1]+1, i, a)) opt.pop_front();

        //cout << i << ": ";
        //for(int x: opt) cout << x << " ";
        //cout << '\n';
        dp[i] = dp[opt.front()] + rmq(opt.front()+1, i, a);

        prefMaxVal = max(prefMaxVal, (long long)a[i]);
        if(i<k) dp[i] = min(dp[i], prefMaxVal);

        //cout << "dp[" << i << "] = " << dp[i] << '\n';
    }

    return convertToAns(dp);
}

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