HDU 5444 Elven Postman(二叉查找树)
2015-09-15 15:56
316 查看
Elven Postman
Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 558 Accepted Submission(s): 308[align=left]Problem Description[/align]
Elves are very peculiar creatures. As we all know, they can live for a very long time and their magical prowess are not something to be taken lightly. Also, they live on trees. However, there is something about them you may not know. Although delivering stuffs through magical teleportation is extremely convenient (much like emails). They still sometimes prefer other more “traditional” methods.
So, as a elven postman, it is crucial to understand how to deliver the mail to the correct room of the tree. The elven tree always branches into no more than two paths upon intersection, either in the east direction or the west. It coincidentally looks awfully like a binary tree we human computer scientist know. Not only that, when numbering the rooms, they always number the room number from the east-most position to the west. For rooms in the east are usually more preferable and more expensive due to they having the privilege to see the sunrise, which matters a lot in elven culture.
Anyways, the elves usually wrote down all the rooms in a sequence at the root of the tree so that the postman may know how to deliver the mail. The sequence is written as follows, it will go straight to visit the east-most room and write down every room it encountered along the way. After the first room is reached, it will then go to the next unvisited east-most room, writing down every unvisited room on the way as well until all rooms are visited.
Your task is to determine how to reach a certain room given the sequence written on the root.
For instance, the sequence 2, 1, 4, 3 would be written on the root of the following tree.
![](https://oscdn.geek-share.com/Uploads/Images/Content/201509/30981026ded2699e6c1311ea59be3432.jpg)
[align=left]Input[/align]
First you are given an integer T(T≤10)
indicating the number of test cases.
For each test case, there is a number n(n≤1000)
on a line representing the number of rooms in this tree. n
integers representing the sequence written at the root follow, respectively a
1
,...,a
n
where a
1
,...,a
n
∈{1,...,n}
.
On the next line, there is a number q
representing the number of mails to be sent. After that, there will be q
integers x
1
,...,x
q
indicating the destination room number of each mail.
[align=left]Output[/align]
For each query, output a sequence of move (E
or W
) the postman needs to make to deliver the mail. For that E
means that the postman should move up the eastern branch and W
the western one. If the destination is on the root, just output a blank line would suffice.
Note that for simplicity, we assume the postman always starts from the root regardless of the room he had just visited.
[align=left]Sample Input[/align]
2
4
2 1 4 3
3
1 2 3
6
6 5 4 3 2 1
1
1
[align=left]Sample Output[/align]
E
WE
EEEEE
题目大意:
给你n个数字,这n个数字是按照二叉搜索树的节点特性给你的,让你建好这棵二叉搜索树,然后,再给出一些询问,让你回答从根节点到某个节点该怎么走?
解题思路:
直接按照左子树<根节点<右子树的方式来建树,然后再根据这种方式从根节点开始查询就可以了。
代码:
# include<cstdio> # include<iostream> # include<cstring> using namespace std; # define MAX 1234 struct Node { int val; int child[2]; Node () { val = 0; memset(child,0,sizeof(child)); } Node ( int val ) { this->val = val; memset(child,0,sizeof(child)); } }; struct Tree { int sz; Node node[MAX]; void clear() { sz = 0; } int newNode( int val ) { node[++sz] = Node(val); return sz; } void insert( int & u,int val ) { if (u==0) { u = newNode(val); return; } if (node[u].val>val) { insert(node[u].child[0],val); } else { insert(node[u].child[1],val); } } void find( int u,int val ) { if ( u==0 ) return; if ( node[u].val > val ) { printf("E"); find(node[u].child[0],val); } else if ( node[u].val < val ) { printf("W"); find(node[u].child[1],val); } } }tree; int main(void) { int t; cin>>t; while ( t-- ) { tree.clear(); int n; cin>>n; int root = 0; for ( int i = 1;i <= n;i++ ) { int tmp; cin>>tmp; tree.insert(root,tmp); } int q; cin>>q; while ( q-- ) { int tmp; cin>>tmp; tree.find(root,tmp); puts(""); } } return 0; }
相关文章推荐
- Handler机制原理
- iOS 定位精度
- CGContextTranslateCTM: invalid context 0x0. If you want to see the backtrace, please set CG_CONTEXT_SHOW_BACKTRACE environmental variable.
- 测试面试-理论
- oracle查看表的高水位
- 最短路径问题3
- 通过USB2514芯片制作的USB HUB接在PC和linux开发板都无法识别的解决
- Unity3d使用线程的姿势
- python 爬虫
- 有关验证码的收藏代码
- MySql空间查询
- CountDownLatch和CyclicBarrier的区别
- 多线程编程--5种方法实现线程同步
- jdbc操作Date类型时的比较
- ios socket第三方框架 AsyncSocket使用简介,连接,心跳,断线,数据发送与接收
- 更新日志 - fir.im 主题壁纸来了
- 理解Linux系统/etc/init.d目录和/etc/rc.local脚本
- JAVA EE企业级开发四步走完全攻略
- 【转】loading 三种实现方式
- iOS学习资源搜集