Submission #747487

#	Time	Username	Problem	Language	Result	Execution time	Memory
747487		Toxtaq	Discharging (NOI20_discharging)	C++17	9 / 100	1086 ms	1048576 KiB

Discharging

#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v;
vector<vector<int>>max_table;
map<pair<int, vector<int>>, long long>table;
long long rec(int indx, vector<int>mx, long long pref){
    long long res = 1e18;
    if(indx == n + 1)return 0;
    if(table.count({indx, mx}))return table[{indx, mx}];
    for(int i = indx;i <= n;++i){
        mx.push_back(max_table[indx][i]);
        pref += max_table[indx][i];
        res = min(res, (i - indx + 1) * pref + rec(i + 1, mx, pref));
        pref -= max_table[indx][i];
        mx.pop_back();
    }
    return table[{indx, mx}] = res;
}
int main()
{
    cin >> n;
    v.resize(n + 1);
    max_table.assign(n + 1, vector<int>(n + 1));
    for(int i = 1;i <= n;++i)cin >> v[i];
    for(int i = 1;i <= n;++i){
        int mx = -1e9;
        for(int j = i;j <= n;++j){
            mx = max(mx, v[j]);
            max_table[i][j] = mx;
        }
    }
    vector<int>tempo;
    cout << rec(1, tempo, 0);
}

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