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;
using ll = long long;
const int N = 200;
const ll INF = (1ll<<50);
void fin() {
#ifdef AM
freopen(".in", "r", stdin);
#endif
}
ll dp[N][N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(nullptr), fin();
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int& x : a) {
cin >> x;
}
a.insert(a.begin(), 0);
for (int i = 0; i <= n; ++i) {
fill(dp[i], dp[i]+N, INF);
}
dp[0][0] = 0;
for (int t = 1; t <= k; ++t) {
for (int i = 1; i <= n; ++i) {
int mx = 0;
for (int j = i; j > 0; --j) {
mx = max(mx, a[j]);
dp[i][t] = min(dp[i][t], dp[j-1][t-1] + mx);
}
}
}
cout << dp[n][k];
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... |