Submission #690878

#TimeUsernameProblemLanguageResultExecution timeMemory
690878saayan007Discharging (NOI20_discharging)C++17
36 / 100
1092 ms15948 KiB
#include <bits/stdc++.h> using namespace std; using ll = long long; using pi = pair<int, int>; using pl = pair<long long, long long>; using vi = vector<int>; using vl = vector<long long>; using vpi = vector<pair<int, int>>; using vpl = vector<pair<long long, long long>>; #define fur(i, a, b) for(ll i = a; i <= (ll)b; ++i) #define ruf(i, a, b) for(ll i = a; i >= (ll)b; --i) #define fr first #define sc second #define mp make_pair #define pb emplace_back #define nl "\n" #define all(x) (x).begin(),(x).end() #define rall(x) (x).rbegin(),(x).rend() const ll inf = 1e16L; int main() { ios::sync_with_stdio(0); cin.tie(0); ll n; cin >> n; ll t[n + 1]; fur(i, 1, n) cin >> t[i]; ll dp[n + 1]; dp[0] = 0; fur(i, 1, n) { dp[i] = inf; ll mx = t[i]; ruf(j, i, 1) { mx = max(mx, t[j]); dp[i] = min(dp[i], dp[j - 1] + mx * (n - j + 1)); } } cout << dp[n] << nl; }
#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...