Codeforces675 D. Tree Construction(构造,二叉排序树性质)
Posted live4m
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了Codeforces675 D. Tree Construction(构造,二叉排序树性质)相关的知识,希望对你有一定的参考价值。
题意:
解法:
对于当前要插入的数字x,
根据二叉排序树的性质:
设前驱为pre(<x),后继为nt(>x),
如果pre没有右节点,那么x作为pre的右节点,
否则x作为nt的左节点.
找前驱和后继可以用set.lower_bound(x)
算法复杂度O(n*log).
code:
#include<bits/stdc++.h>
// #define SYNC_OFF
#define int long long
#define ll long long
#define ull unsigned long long
//fast-coding
#define ST(x) x.begin()
#define ED(x) x.end()
#define RST(x) x.rbegin()
#define RED(x) x.end()
#define CL(x) x.clear();
#define all(a,n) a+1,a+1+n
#define ff(i,n) for(ll i=1;i<=n;i++)
#define rff(i,n) for(ll i=n;i>=1;i--)
#define fff(i,n) for(ll i=0;i<n;i++)
#define rfff(i,n) for(ll i=n-1;i>=0;i--)
#define SC(x) scanf("%s",x)
#define SL(x) strlen(x)
#define pss(a) push_back(a)
#define ps(a) push(a)
#define SZ(x) (int)x.size()
#define pee puts("");
#define eee putchar(' ');
#define re readdd()
#define pr(a) printtt(a)
int readdd(){int x=0,f=1;char c=getchar();//
while(!isdigit(c)&&c!='-')c=getchar();
if(c=='-')f=-1,c=getchar();
while(isdigit(c))x=x*10+c-'0',c=getchar();
return f*x;}
void printtt(int x){if(x<0)putchar('-'),x=-x;//
if(x>=10)printtt(x/10);putchar(x%10+'0');}
int gcd(int a,int b){return b==0?a:gcd(b,a%b);}//
int ppow(int a,int b,int mod){a%=mod;//
int ans=1%mod;while(b){if(b&1)ans=(long long)ans*a%mod;
a=(long long)a*a%mod;b>>=1;}return ans;}
bool addd(int a,int b){return a>b;}
int lowbit(int x){return x&-x;}
const int dx[4]={0,0,1,-1};
const int dy[4]={1,-1,0,0};
bool isdigit(char c){return c>='0'&&c<='9';}
bool Isprime(int x){
for(int i=2;i*i<=x;i++)if(x%i==0)return 0;
return 1;
}
void ac(int x){if(x)puts("YES");else puts("NO");}
//short_type
#define VE vector<int>
#define PI pair<int,int>
//
using namespace std;
// const int mod=998244353;
const int mod=1e9+7;
const int maxm=2e6+5;
int a[maxm];
int f[maxm];
map<int,int>l,r;
int n;
void solve(){
n=re;
ff(i,n)a[i]=re;
set<int>s;
ff(i,n){
s.insert(a[i]);
if(i==1)continue;
auto it=s.lower_bound(a[i]);
auto it1=it;
if(it!=ST(s)){
it--;
if(!r[*it]){
r[*it]=1;
f[i]=*it;
continue;
}
}
it=it1;
it++;
if(it!=ED(s)){
if(!l[*it]){
l[*it]=1;
f[i]=*it;
}
}
}
for(int i=2;i<=n;i++){
pr(f[i]);eee;
}
pee;
}
void Main(){
// #define MULTI_CASE
#ifdef MULTI_CASE
int T;cin>>T;while(T--)
#endif
solve();
}
void Init(){
#ifdef SYNC_OFF
ios::sync_with_stdio(0);cin.tie(0);
#endif
#ifndef ONLINE_JUDGE
freopen("../in.txt","r",stdin);
freopen("../out.txt","w",stdout);
#endif
}
signed main(){
Init();
Main();
return 0;
}
以上是关于Codeforces675 D. Tree Construction(构造,二叉排序树性质)的主要内容,如果未能解决你的问题,请参考以下文章
codeforces 675D Tree Construction set
CodeForces 675D Tree Construction
codeforces 675D Tree Construction
Codeforces 675D Tree Construction Splay伸展树