1497. 树的遍历 - AcWing题库
al....... x .......ar
bl...k-1 k k+1...br
k-1 -bl =x-al === x = al + k - 1 - bl 左子树的大小 ==> 左子树的最后一个数在后序遍历中的位置
不用bfs
#include <bits/stdc++.h>
#include <iostream>
#include<unordered_map>
#include<unordered_set>
#define x first
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL ;
typedef unsigned long long ULL ;
typedef pair<int,int> PII ;
typedef pair<LL,int> PLI ;
const int N = 30+ 10 ,M=1000 + 10,INF = 0x3f3f3f3f, P = 131;
const LL INF2 = 1e17;
int n;
int a[N],b[N],p[N];
vector<int> le[N];
void build(int al,int ar,int bl,int br,int d)
{
if(al > ar ) return;
int v = a[ar];// 后序遍历的 最后一个节点就是根节点
le[d].push_back(v);
int k= p[v];
build(al,al + k - 1 - bl ,bl ,k-1,d + 1 );
build(al+k-bl,ar-1,k+1,br,d+1);
}
inline void solve()
{
cin >> n;
for(int i=0;i<n; i ++ ) cin >> a[i]; //读入 后序遍历
for(int i=0;i<n;i ++ ) cin >> b[i]; // 读入 中序遍历
for(int i=0;i<n;i ++ )p[b[i]] = i;
build(0,n-1,0,n-1,0);
for(int i=0;i<n;i ++ )
for(int x:le[i])
cout << x << " ";
}
signed main()
{
ios
int T=1;
// cin>>T;
while(T -- )
{
solve();
}
return 0;
}
#include <bits/stdc++.h>
#include <iostream>
#include<unordered_map>
#include<unordered_set>
#define x first
#define y second
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL ;
typedef unsigned long long ULL ;
typedef pair<int,int> PII ;
typedef pair<LL,int> PLI ;
const int N = 30+ 10 ,M=1000 + 10,INF = 0x3f3f3f3f, P = 131;
const LL INF2 = 1e17;
int n;
int a[N],b[N],p[N];
int l[N],r[N];
int build(int al,int ar,int bl,int br,int d)
{
if(al > ar ) return 0;
int v = a[ar];// 后序遍历的 最后一个节点就是根节点
int k= p[v];
l[v] = build(al,al + k - 1 - bl ,bl ,k-1,d + 1 );
r[v] = build(al+k-bl,ar-1,k+1,br,d+1);
return v;
}
void bfs() {
queue<int> q;
q.push(a[n - 1]);
while (q.size()) {
int t = q.front();
q.pop();
cout << t << " ";
if (l[t]) q.push(l[t]);
if (r[t]) q.push(r[t]);
}
}
inline void solve()
{
cin >> n;
for(int i=0;i<n; i ++ ) cin >> a[i]; //读入 后序遍历
for(int i=0;i<n;i ++ ) cin >> b[i]; // 读入 中序遍历
for(int i=0;i<n;i ++ )p[b[i]] = i;
build(0,n-1,0,n-1,0);
bfs();
}
signed main()
{
ios
int T=1;
// cin>>T;
while(T -- )
{
solve();
}
return 0;
}