# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
311860 | nikatamliani | K blocks (IZhO14_blocks) | C++14 | 484 ms | 59808 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>
using namespace std;
const int N = 1e5 + 10, K = 105, oo = 1e9;
int n, k, a[N], dp[N][K];
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; ++i) {
cin >> a[i];
}
for(int i = 0; i < N; ++i) {
for(int j = 0; j < K; ++j) {
dp[i][j] = oo;
}
}
stack < int > st;
dp[0][0] = 0;
vector < int > v[k + 1];
v[0].push_back(0);
// for(int i = 0; i <= k; ++i) v[i].push_back(0);
for(int i = 1; i <= n; ++i) {
while(!st.empty() && a[st.top()] <= a[i]) st.pop();
int x = 0;
if(!st.empty()) x = st.top();
for(int j = min(i, k); j >= 1; --j) {
dp[i][j] = dp[x][j];
int l = 0, r = (int)v[j - 1].size() - 1, ans = -1;
while(r >= l) {
int m = l + r >> 1;
if(v[j - 1][m] >= x) {
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... |