# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
637480 | Arinoor | LIS (INOI20_lis) | C++17 | 1592 ms | 128356 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 ios ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define bug2(x, y) cout << #x << ' ' << #y << " : " << x << ' ' << y << endl
#define bug(x) cout << #x << " : " << x << endl
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1e6 + 10;
const int maxlg = 20;
const int mod = 1e9 + 7;
const int inf = 1e9 + 10;
int q, ind[maxn], a[maxn], dp[maxn], ans;
int fen[maxn];
pii Q[maxn];
set<int> S[maxn];
void add(int i, int x){
for(; i <= q; i += i & -i)
fen[i] += x;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |