# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993870 | TranThuMinh | K blocks (IZhO14_blocks) | C++17 | 1 ms | 992 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 N = 1e3 + 5,
K = 105,
INF = 1e17;
int n, k;
int a[N];
int f[N][K], ma[N][N];
signed main() {
cin.tie(0)->sync_with_stdio(0);
if(fopen("task.inp", "r")) {
freopen("task.inp", "r", stdin);
freopen("task.out", "w", stdout);
}
cin >> n >> k;
for(int i = 1; i <= n; ++i) cin >> a[i];
for(int i = 1; i <= n; ++i) {
ma[i][i] = a[i];
for(int j = i + 1; j <= n; ++j) ma[i][j] = max(ma[i][j - 1], a[j]);
}
for(int i = 0; i <= n; ++i)
for(int j = 0; j <= k; ++j) f[i][j] = INF;
f[0][0] = 0;
for(int i = 1; i <= n; ++i) {
for(int o = 1; o <= k; ++o) {
for(int j = 1; j <= i; ++j) f[i][o] = min(f[i][o], f[j - 1][o - 1] + ma[j][i]);
}
}
cout << f[n][k];
}
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... |