Submission #770550

#TimeUTC-0UsernameProblemLanguageResultExecution timeMemory
7705502023-07-01 13:06:13amirhoseinfar1385LIS (INOI20_lis)C++17
100 / 100
2525 ms215248 KiB
#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]);
}
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...