제출 #320751

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
320751		saarang123	Discharging (NOI20_discharging)	C++14	36 / 100	123 ms	17508 KiB

Discharging

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int inf = 1e15;
const int N = 1502;
int dp[N];
signed main() {
    std::ios::sync_with_stdio(0);
    std::cout.tie(0);
    std::cin.tie(0);
    int n; cin >> n;
    vector<int> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    for(int i = n; i; i--) {
        dp[i] = inf;
        int mx = 0;
        for(int j = i; j <= n; j++) {
            mx = max(mx, a[j]);
            dp[i] = min(dp[i], dp[j + 1] + (n - i + 1) * mx);
            //if u choose it, it gets added to all (n - i + 1) customers after
            //eliminating the need for end_time :D
        }
    }
    cout << dp[1] << '\n';
    return 0;
}

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