HDU3999-The order of a Tree
来源:互联网 发布:c语言base64编码 编辑:程序博客网 时间:2024/06/15 09:10
The order of a Tree
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 64 Accepted Submission(s) : 34
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
As we know,the shape of a binary search tree is greatly related to the order of keys we insert. To be precisely:
1. insert a key k to a empty tree, then the tree become a tree with only one node;
2. insert a key k to a nonempty tree, if k is less than the root ,insert it to the left sub-tree;else insert k to the right sub-tree.
We call the order of keys we insert “the order of a tree”,your task is,given a oder of a tree, find the order of a tree with the least lexicographic order that generate the same tree.Two trees are the same if and only if they have the same shape.
1. insert a key k to a empty tree, then the tree become a tree with only one node;
2. insert a key k to a nonempty tree, if k is less than the root ,insert it to the left sub-tree;else insert k to the right sub-tree.
We call the order of keys we insert “the order of a tree”,your task is,given a oder of a tree, find the order of a tree with the least lexicographic order that generate the same tree.Two trees are the same if and only if they have the same shape.
Input
There are multiple test cases in an input file. The first line of each testcase is an integer n(n <= 100,000),represent the number
of nodes.The second line has n intergers,k1 to kn,represent the order of a tree.To make if more simple, k1 to kn is a sequence of
1 to n.
Output
One line with n intergers, which are the order of a tree that generate the same tree with the least lexicographic.
Sample Input
41 3 4 2
Sample Output
1 3 2 4
#include <iostream>#include <stdio.h>#include <string.h>using namespace std;#define N 100005int tree[N],l[N],r[N],a[N],num,flag,m;void fx(int k,int x){ if( x <= tree[k] ) { if(l[k] == -1) l[k] = flag; else fx(l[k],x); } else { if(r[k] == -1) r[k] = flag; else fx(r[k],x); }}void f(int k){ a[m++] = tree[k]; if(l[k] != -1) f(l[k]); if(r[k] != -1) f(r[k]);}int main(){ int n,i,x,root; while(~scanf("%d",&n)) { memset(l,-1,sizeof(l)); memset(r,-1,sizeof(r)); root = -1; flag = 0; for(i = 0; i< n; i++) { scanf("%d",&x); if(root == -1) tree[++root] = x; else { tree[++flag] = x; fx(root,x); } } m = 0; f(root); for(i = 0; i < m -1; i++) printf("%d ",a[i]); printf("%d\n",a[m-1]); } return 0;}
0 0
- HDU3999:The order of a Tree
- HDU3999-The order of a Tree
- Hdu3999 The order of a Tree
- hdu3999 The order of a Tree(BST)
- hdu3999 The order of a Tree二叉搜索树
- hdu3999 the order of a tree - BST二叉搜索树的前序遍历
- HDU3999 The order of a Tree(构建二叉搜索树模板指针)
- hdu 3999The order of a Tree
- Hdu 3999 - The order of a Tree
- HDU 3999 The order of a Tree
- The order of a Tree HDU
- hdu 3999:The order of a Tree
- HDU The order of a Tree
- hdu 3999The order of a Tree
- hdu 3999 The order of a Tree
- hdu 3999 The order of a Tree
- hdu 3999 The order of a Tree
- hdu 3999 The order of a Tree
- ssm(spring+springMVC+Mybatis)框架集成Mongodb
- https://github.com/hehonghui/android-tech-frontier
- nanipi iic驱动分析
- 2016武汉科技大学邀请赛现场赛 F题
- innobackupex恢复操作解压备份文件报错一例
- HDU3999-The order of a Tree
- matlab膨胀和腐蚀的案例详解
- WERTYU
- Java数组操作的疑惑(这篇错误,后来才知道是有static修饰的结果)
- Android:我遇到的OOM以及解决方法
- spring 源码如何导入到eclipse
- Android的5种布局
- UILabel 中文本的多样式显示
- 算法导论-KMP