Submission #485725

#	Time	Username	Problem	Language	Result	Execution time	Memory
485725		blue	Discharging (NOI20_discharging)	C++17	36 / 100	1091 ms	15944 KiB

Discharging

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

using ll = long long;
using vll = vector<ll>;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int N;
    cin >> N;

    vll t(N+1);
    t[N] = 0;
    for(int i = 0; i < N; i++) cin >> t[i];

    reverse(t.begin(), t.end());

    vll dp(1+N, 1'000'000'000'000'000'000LL);
    dp[0] = 0;

    for(int i = 1; i <= N; i++)
    {
        ll curr_max = 0;
        for(int j = i-1; j >= 0; j--)
        {
            curr_max = max(curr_max, t[j+1]);
            dp[i] = min(dp[i], dp[j] + curr_max * i);
        }
    }

    // for(int i = N; i >= 1; i--)
    // {
    //     ll curr_max = 0;
    //     for(int j = i+1; j <= N+1; j++)
    //     {
    //         curr_max = max(curr_max, t[j-1]);
    //         dp[i] = min(dp[i], dp[j] + curr_max * (N - (i - 1)));
    //     }
    // }
    // for(int i = 1; i <= N; i++)
    // {
    //     ll curr_max = 0;
    //     for(int j = i-1; j >= 0; j--)
    //     {
    //         curr_max = max(curr_max, t[j+1]);
    //         dp[i] = min(dp[i], dp[j] + curr_max * (N - j));
    //     }
    // }

    cout << dp[N] << '\n';
}

• Subtask 1: 9 / 9
• Subtask 2: 13 / 13
• Subtask 3: 0 / 25
• Subtask 4: 0 / 11
• Subtask 5: 14 / 14
• Subtask 6: 0 / 28