Submission #494804

#TimeUsernameProblemLanguageResultExecution timeMemory
494804blueDischarging (NOI20_discharging)C++17
0 / 100
1091 ms15944 KiB
#include <iostream>
#include <vector>
#include <cassert>
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(1+N);
    t[0] = 0;
    for(int i = 1; i <= N; i++) cin >> t[i];

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

    vll diff;

    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));
        }

        // if(i > 1) diff.push_back(dp[i] - dp[i-1]);
        if(i > 2) assert(dp[i-1] - dp[i-2] >= dp[i] - dp[i-1]);
    }

    cout << dp[N] << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...