| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 671913 | moday_morning | K blocks (IZhO14_blocks) | C++17 | 0 ms | 0 KiB |
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>
#define int long long
using namespace std;
const int MAXX = 1e18 + 3;
int n, k, dp[100000][100000];
void solve () {
cin >> n >> k;
vector <int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
fill(dp[i], dp[i] + 200, 1e18);
}
dp[0][0] = 0;
for (int i = 1; i <= n; i++) {
for (int l = 1; l <= k; l++) {
int mx = 0;
for (int j = i; j >= 1 && j >= l; j--) {
mx = max(mx, a[j]);
dp[i][l] = min(dp[i][l], dp[j - 1][l - 1] + mx);
}
}
}
cout << dp[n][k] << "\n";
}
signed main() {
// usaco("triangles");
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
}