# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747501 | Toxtaq | Discharging (NOI20_discharging) | C++17 | 406 ms | 1048576 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
int n;
vector<int>v;
vector<vector<int>>max_table;
vector<long long>table;
long long rec(int indx){
long long res = 1e18;
if(indx == n + 1)return 0;
if(table[indx] != -1)return table[indx];
for(int i = indx;i <= n;++i){
res = min(res, (long long)(n - indx + 1) * max_table[indx][i] + rec(i + 1));
}
return table[indx] = res;
}
int main()
{
cin >> n;
v.resize(n + 1);
table.assign(n + 1, -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;
}
}
cout << rec(1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |