# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
345411 | 2021-01-07T09:18:24 Z | bachaquer | K blocks (IZhO14_blocks) | C++14 | 1 ms | 620 KB |
#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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Incorrect | 1 ms | 620 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Incorrect | 1 ms | 620 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Incorrect | 1 ms | 620 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 492 KB | Output is correct |
2 | Incorrect | 1 ms | 620 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |