ZOJ 3965 Binary Tree Restoring

Binary Tree Restoring

思路：

递归

比较a序列和b序列中表示同一个子树的一段区间，不断递归

代码：

#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))const int N=1e5+5;
int a[N],b[N],par[N],posa[N],posb[N],sum[N],n;
void dfs(int l,int r,int ll,int rr,int pa){if(l>r||ll>rr||r>n||rr>n)return ;if(a[l]==b[ll]){par[a[l]]=pa;sum[pa]++;dfs(l+1,r,ll+1,rr,a[l]);}else{par[a[l]]=par[b[ll]]=pa;sum[pa]+=2;int len1=posa[b[ll]]-l;int len2=posb[a[l]]-ll;dfs(l+1,l+len1-1,posb[a[l]]+1,posb[a[l]]+len1-1,a[l]);dfs(posa[b[ll]]+1,posa[b[ll]]+len2-1,ll+1,ll+len2-1,b[ll]);while(sum[pa]==2)pa=par[pa];dfs(l+len1+len2,r,ll+len1+len2,rr,pa);}
}
int main(){int T;scanf("%d",&T);while(T--){scanf("%d",&n);for(int i=1;i<=n;i++)scanf("%d",&a[i]),posa[a[i]]=i;for(int i=1;i<=n;i++)scanf("%d",&b[i]),posb[b[i]]=i;mem(sum,0);dfs(1,n,1,n,0);for(int i=1;i<=n;i++)printf("%d%c",par[i]," \n"[i==n]);}return 0;
}

转载于:https://www.cnblogs.com/widsom/p/8559158.html

ZOJ 3965 Binary Tree Restoring相关推荐

107. Binary Tree Level Order Traversal II
题目 Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from l ...
102. Binary Tree Level Order Traversal
题目 Binary Tree Level Order Traversal 层次遍历二叉树链接 Given a binary tree, return the level order traversa ...
[Java]LeetCode297. 二叉树的序列化与反序列化 | Serialize and Deserialize Binary Tree
★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★★ ➤微信公众号:山青咏芝(shanqingyongzhi) ➤博客园地址:山青咏芝(https://www.cnblog ...
LeetCode刷题记录14——257. Binary Tree Paths（easy）
LeetCode刷题记录14--257. Binary Tree Paths(easy) 目录前言题目语言思路源码后记前言数据结构感觉理论简单,实践起来很困难. 题目给定一个二叉树, ...
二叉树的路径（根节点到叶节点）Binary Tree Paths
为什么80%的码农都做不了架构师?>>> 问题: Given a binary tree, return all root-to-leaf paths. For example ...
LeetCode - Maximum Depth of Binary Tree
递归求二叉树的最大深度. /*** Definition for binary tree* public class TreeNode {* int val;* TreeNode left;* Tre ...
Balanced Binary Tree leetcode java
题目: Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced bin ...
[leetcode] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...
PAT（甲级）2019年春季考试 7-4 Structure of a Binary Tree
目录整体思路犯的错误代码整体思路 1.先根据后序和中序序列建树,老生常谈,记得返回root 2.对树进行BFS,在这个过程中用hash的方式记录下每个值对应的父节点.左孩子.右孩子的值,记录下 ...

ZOJ 3965 Binary Tree Restoring

ZOJ 3965 Binary Tree Restoring相关推荐

最新文章

热门文章