# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
783037 | RushB | LIS (INOI20_lis) | C++17 | 1084 ms | 43152 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;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
using ar = array<int, 2>;
const int INF = 1ll << 30;
const int N = 1e6 + 6;
int n, x[N], p[N], q, ans[N], S[4 * N], delta[4 * N];
ar M[1500], a[N], b[N];
void add(int v, int l, int r, int L, int R, int d) {
if (R <= l || r <= L) return;
if (L <= l && r <= R) {
delta[v] += d, S[v] += d;
return;
}
int m = l + r >> 1;
add(v << 1, l, m, L, R, d), add(v << 1 | 1, m, r, L, R, d);
S[v] = min(S[v << 1], S[v << 1 | 1]) + delta[v];
}
int find(int v, int l, int r) {
if (l + 1 == r) {
S[v] = INF;
if (l + 1 != q) add(1, 0, q, l + 1, q, -1);
return l;
}
int m = l + r >> 1, x;
if (S[v << 1 | 1] <= S[v << 1]) x = find(v << 1 | 1, m, r);
else x = find(v << 1, l, m);
S[v] = min(S[v << 1], S[v << 1 | 1]) + delta[v];
return x;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |