# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
766947 | aris12345678 | K blocks (IZhO14_blocks) | C++14 | 1073 ms | 4436 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>
using namespace std;
const int mxN = 1e5+5;
const int mxK = 105;
int a[mxN], dp[mxN][mxK];
int main() {
int n, k;
scanf("%d %d", &n, &k);
for(int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
dp[i][1] = max(dp[i-1][1], a[i]);
}
// for(int i = 1; i <= n; i++)
// cout << dp[i][1] << " ";
// cout << "\n";
for(int j = 2; j <= k; j++) {
for(int i = 1; i <= n; i++) dp[i][j] = INT_MAX;
for(int i = j; i <= n; i++) {
int mx = 0;
for(int u = i; u >= j; u--) {
mx = max(mx, a[u]);
// cout << dp[i][j] << " " << mx << " " << dp[u-1][j-1] << "\n";
dp[i][j] = min(dp[i][j], mx+dp[u-1][j-1]);
}
// cout << dp[i][j] << " ";
}
// cout << "\n";
}
printf("%d\n", dp[n][k]);
return 0;
}
Compilation message (stderr)
# | 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... |