# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671305 | 2022-12-12T19:11:41 Z | hct_2so1 | K blocks (IZhO14_blocks) | C++17 | 17 ms | 41300 KB |
#include <bits/stdc++.h> using namespace std; const int N = 1e5 + 5; const int K = 105; const int INF = 0x3f3f3f3f; int a[N]; int L[N], minF[N]; int dp[K][N]; int n, k; int main() { freopen("blocks.in", "r", stdin); freopen("blocks.out", "w", stdout); cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> a[i]; memset(dp, 0x3f, sizeof dp); dp[1][0] = 0; for (int i = 1; i <= n; ++i) dp[1][i] = max(dp[1][i - 1], a[i]); for (int i = 2; i <= k; ++i) { stack<pair<int, int> > S; for (int j = i; j <= n; ++j) { int minF = dp[i - 1][j - 1]; while (!S.empty() && a[S.top().second] <= a[j]) { minF = min(minF, S.top().first); //cout<<S.top().second<<' '<<S.top().first<<'\n'; S.pop(); } dp[i][j] = min(dp[i][S.empty() ? 0 : S.top().second], minF + a[j]); S.push(make_pair(minF, j)); } } cout << dp[k][n] << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 41300 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 41292 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 41300 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 17 ms | 41300 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |