oj.uz

답안 #1092670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1092670 2024-09-24T17:54:51 Z alexdd Peru (RMI20_peru) C++17
0 / 100
 1 ms 348 KB 
#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];
long long getmax(int le, int ri)
{
    long long mxm=0;
    for(int i=le;i<=ri;i++)
        mxm = max(mxm, a[i]);
    return mxm;
}
int solve(int n, int k, int* v)
{
    a[0]=2e9+2;
    deque<pair<int,int>> dq;///{poz,mxm}
    dq.push_back({0,0});
    for(int i=1;i<=n;i++)
    {
        a[i]=v[i-1];
        dp[i]=INF;
        dp[i] = min(dp[i], dp[max(0,i-k)]+getmax(max(0,i-k)+1,i));
        while(!dq.empty() && dq.front().first < i-k)
            dq.pop_front();
        //cerr<<i<<"  "<<dq.front().first<<" primu\n";
        int ult=-1;
        while(!dq.empty() && a[i] >= dq.back().second)
        {
            ult = dq.back().first;
            dq.pop_back();
        }
        if(ult!=-1)
        {
            if(dq.empty() || dp[ult]+a[i] < dp[dq.back().first]+dq.back().second)
               dq.push_back({ult,a[i]});
        }
        //cerr<<i<<"  "<<dq.back().first<<" "<<dq.back().second<<"  de unde ia i\n";
        if(!dq.empty()) dp[i] = min(dp[i], dp[dq.back().first] + dq.back().second);
        if(dq.empty() || dp[i] < dp[dq.back().first]+dq.back().second)
            dq.push_back({i,0});
        //cerr<<i<<" "<<dp[i]<<" dp\n";
    }

    long long rez=0,put23=1;
    for(int i=n;i>0;i--)
    {
        rez = (rez + dp[i]%MOD*put23)%MOD;
        put23 = put23*23LL%MOD;
    }
    return rez;
}
/*
8 3
3 2 9 8 7 11 3 4

*/

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -