# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770550 | amirhoseinfar1385 | LIS (INOI20_lis) | C++17 | 2525 ms | 215248 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 maxn=1e6+5;
int par[maxn],link[maxn],n,dpnah[maxn],inf=1e7,res=0,nt[maxn];
pair<int,int>all[maxn],dov[maxn];
struct lev{
vector<int>ind;
vector<int>x;
int sz=0,kaf;
struct segmentmaxa{
int kaf;
vector<int>seg;
void ins(int i,int w){
if(i==0){
return ;
}
seg[i]=max(seg[i],w);
return ins((i>>1),w);
}
void erase(int i){
if(i==0){
return ;
}
if(i>=kaf){
seg[i]=0;
}
else{
seg[i]=max(seg[(i<<1)],seg[(i<<1)^1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |