This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int dp[100001][101];
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, k;
cin >> n >> k;
int a[1 + n]; a[0] = 0;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
dp[i][1] = max(dp[i - 1][1], a[i]);
}
auto getmax = [&](int l, int r) -> int{
return *max_element(a + l, a + r + 1);
};
for (int j = 2; j <= k; j++) {
for (int i = 1; i <= n; i++) {
int mn = INT_MAX;
for (int l = 1; l < i; l++) {
mn = min(mn, dp[l][j - 1] + getmax(l + 1, i));
}
dp[i][j] = mn;
}
}
cout << dp[n][k] << '\n';
return 0;
}
# | 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... |