#include <bits/stdc++.h>
#define ar array
//#define int long long
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const ll inf = 1e18;
const int N = 1e6 + 5;
signed main() {
int n; cin >> n;
vector<int> a(n+1);
for(int i=1; i<=n; i++) cin >> a[i];
vector<ll> dp(n+1, 1e18); dp[0] = 0;
for(int i=1; i<=n; i++) {
int mx = 0;
for(int j=i; j>=1; j--) {
mx = max(mx, a[j]);
ll c = (ll)(n-j+1) * mx;
dp[i] = min(dp[i], dp[j-1] + c);
}
}
cout << dp[n] << '\n';
}
# | 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... |