#include <bits/stdc++.h> using namespace std; int main() { int N; cin >> N; vector<long long> T(N + 1); for (int i = 1; i <= N; i++) { cin >> T[i]; } const long long INF = 1e18; vector<long long> dp(N + 1, INF); dp[0] = 0; for (int i = 1; i <= N; i++) { long long curMax = 0; for (int j = i; j >= 1; j--) { curMax = max(curMax, T[j]); int groupSize = i - j + 1; dp[i] = min(dp[i], dp[j - 1] + groupSize * curMax); } } cout << dp[N] << "\n"; }