# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
285122 | 3zp | Discharging (NOI20_discharging) | C++14 | 1091 ms | 13816 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>
#define ll long long
using namespace std;
ll t[1000009],dp[1000009];
main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin>>n;
for(int i = 1;i <= n;i++){
cin >> t[i];
t[i] = max(t[i], t[i-1]);
}
dp[n] = t[n];
for(int i = n; i >= 1; i--){
dp[i] = dp[i+1] + (n-i+1) * t[i];
for(int j = i+1; j <= n; j++){
dp[i] = min(dp[i], t[j]*(n-i+1) + dp[j+1]);
}
}
cout<<dp[1]<<endl;
}
Compilation message (stderr)
# | 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... |