Submission #288251

#TimeUsernameProblemLanguageResultExecution timeMemory
288251someone_aaDischarging (NOI20_discharging)C++17
13 / 100
4 ms640 KiB
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define sz(x) int(x.size())
using namespace std;
const int maxn = 1510;
ll n, arr[maxn], dp[maxn];

int main() {
	cin>>n;

	dp[0] = 0;
	for(int i=1;i<=n;i++) {
		cin>>arr[i];

		ll maxval = 0LL;

		dp[i] = LLONG_MAX;
		for(int j=i;j>=1 && arr[j] <= arr[i];j--) {
			maxval = max(maxval, arr[j]);

			dp[i] = min(dp[i], dp[j-1] + (n - j + 1) * maxval);
		}
	}

	cout<<dp[n]<<"\n";
	return 0;
}
#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...