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;
const int N = 105;
const int INF = 1e9;
int n, m, a[N], f[N][N];
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; ++i) cin >> a[i];
for (int i = 0; i <= m; ++i) for (int j = 0; j <= n; ++j) f[i][j] = INF;
f[0][0] = 0;
for (int i = 1; i <= m; ++i) {
for (int j = 1; j <= n; ++j) {
int mx = 0;
for (int k = j; k >= 1; --k) {
mx = max(mx, a[k]);
f[i][j] = min(f[i][j], f[i - 1][k - 1] + mx);
}
}
}
cout << f[m][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... |