# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445795 | dxz05 | K blocks (IZhO14_blocks) | C++14 | 1 ms | 204 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>
#pragma GCC optimize("Ofast")
using namespace std;
#define SZ(x) (int)(x).size()
const int MAXN = 1e6 + 3e2;
int a[MAXN];
int dp[111][111];
int main(){
//ios_base::sync_with_stdio(false);
//cin.tie(nullptr); cout.tie(nullptr);
int n, k;
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++){
scanf("%d", a + i);
}
for (int i = 1; i <= n; i++){
fill(dp[i] + 1, dp[i] + k + 1, 1e9);
}
for (int i = 1; i <= n; i++){
for (int j = 1; j <= i; j++){
int mx = 0;
for (int l = i; l >= j; l--){
mx = max(mx, a[l]);
dp[i][j] = min(dp[i][j], dp[l - 1][j - 1] + mx);
}
//cout << dp[i][j] << ' ';
}
//cout << endl;
}
printf("%d", 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... |