# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
759928 | The_Samurai | LIS (INOI20_lis) | C++17 | 4050 ms | 1100 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;
struct SegTree {
int len, neutral_element = 0;
vector<int> tree;
void init(int n) {
len = 1;
while (len < n) len *= 2;
tree.assign(2 * len, 0);
}
SegTree(int n) {
init(n);
}
SegTree() {}
inline int type(int a, int b) {
return max(a, b);
}
void set(int i, int v) {
i += len;
tree[i] = type(tree[i], v);
while (i > 1) {
i >>= 1;
tree[i] = type(tree[i << 1], tree[i << 1 | 1]);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |