#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 1e6+5;
ll n,t[N],dp[N];
int main(){
// freopen("input","r",stdin);
// freopen("output","w",stdout);
cin >> n;
for(int i=1;i<=n;i++){
cin >> t[i];
}
for(int i=1;i<=n;i++){
ll mx = t[i]; dp[i] = 1e18;
for (int j=i-1; j>=0; j--) dp[i]=min(dp[i], dp[j]+mx*(n-j)), mx=max(mx, t[j]);
}
cout << dp[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... |