# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31755 | 2017-09-06T04:15:33 Z | aome | K blocks (IZhO14_blocks) | C++14 | 3 ms | 3352 KB |
#include <bits/stdc++.h> using namespace std; typedef pair<int, int> ii; const int N = 100005; const int INF = 1e9; int n, k, f[2][N], a[N]; int main() { freopen("in.txt", "r", stdin); //freopen("out.txt", "w", stdout); ios::sync_with_stdio(false); cin >> n >> k; for (int i = 1; i <= n; ++i) cin >> a[i]; for (int i = 1; i <= n; ++i) f[0][i] = INF; for (int i = 1; i <= k; ++i) { bool t = i & 1; stack<ii> st[2]; f[t][0] = INF; for (int j = 1; j <= n; ++j) { int pos = j; int val = f[t ^ 1][j - 1]; while (st[0].size() && a[st[0].top().first] <= a[j]) { pos = st[0].top().first; val = min(val, st[0].top().second); st[0].pop(); } st[0].push(ii(j, val)); while (st[1].size() && st[1].top().first >= pos) st[1].pop(); if (!(st[1].size() && st[1].top().second <= val + a[j])) { st[1].push(ii(pos, val + a[j])); } f[t][j] = st[1].top().second; //cout << pos << ' ' << val << ' ' << f[t][j] << ' ' << j << '\n'; } } cout << f[k & 1][n]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 3352 KB | Execution killed because of forbidden syscall gettid (186) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 3352 KB | Execution killed because of forbidden syscall gettid (186) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 3352 KB | Execution killed because of forbidden syscall gettid (186) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 0 ms | 3352 KB | Execution killed because of forbidden syscall gettid (186) |
2 | Halted | 0 ms | 0 KB | - |