| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 345411 | bachaquer | K blocks (IZhO14_blocks) | C++14 | 1 ms | 620 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 ll long long
#define pb push_back
using namespace std;
const int N = 2e4;
const int INF = 1e5;
int dp[N][N];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int n, k, x;
    cin >> n >> k;
    vector<int> v;
    v.pb(0);
    for (int i = 1; i <= n; i++) {
        cin >> x;
        v.pb(x);
    }
    for (int i = 0; i <= n; i++) {
        for (int j = 1; j <= N; j++) {
            dp[i][j] = 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, v[j]);
                dp[i][t] = min(dp[i][t], dp[j - 1][t - 1] + mx);
            }
        }
    }
    cout << 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... | ||||
