F - Elven Postman HDU - 5444

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. 

Input

First you are given an integer T(T≤10)T(T≤10) indicating the number of test cases. 

For each test case, there is a number n(n≤1000)n(n≤1000) on a line representing the number of rooms in this tree. nn integers representing the sequence written at the root follow, respectively a1,...,ana1,...,an where a1,...,an∈{1,...,n}a1,...,an∈{1,...,n}. 

On the next line, there is a number qq representing the number of mails to be sent. After that, there will be qq integers x1,...,xqx1,...,xq indicating the destination room number of each mail.

Output

For each query, output a sequence of move (EE or WW) the postman needs to make to deliver the mail. For that EE means that the postman should move up the eastern branch and WW 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.

Sample Input

2
4
2 1 4 3
3
1 2 3
6
6 5 4 3 2 1
1
1

Sample Output

E

WE
EEEEE

题目大意：就是按照第一行的  n 个数生成搜索二叉树 然后 一行  m 个数 找到每个数在树里面的位置，从根开始找，在根的左边输出 E 右边 W在找下一个 根节点，直到找到这个数。

解题思路 ：就是构建一个搜索二叉树，然后从根节点开始搜索这个点，在点左边输出 E，在右边输出 W，在根节点返回。

主要代码就是

1. void find(Note *note, int x)
2. {
3.       if(note !=NULL)
4.      {     
5.         if(x==note->data)   return;  //找到了这个数 
6.         if(x<note->data)                //在根节点的左边
7.         {
8.         printf("E"); find(note -> left,x);
9.         }
10.       if(x>note->data)              //在根节点的右边
11.       {
12.         printf("W"); find(note -> right,x);
13.       }
14.    }
15. }

完整代码：

1. #include<stdio.h>
2. #include<stdlib.h>
3. int k;
4. typedef struct note
5. {
6.     int data;
7.     struct note *left;
8.     struct note *right;
9. } Note;
10. typedef struct
11. {
12.     Note *root;
13. } Tree;
14. void insert(Tree *tree,int value)  //构建搜索二叉树
15. {
16.     Note *note = malloc(sizeof(Note));
17.     note ->data =value;
18.     note ->left =NULL;
19.     note ->right=NULL;
20.     if(tree->root==NULL)
21.     {
22.         tree -> root=note;
23.     }
24.     else
25.     {
26.         Note *temp= tree ->root;
27.         while(temp != NULL)
28.         {
29.             if(value<temp -> data)
30.             {
31.                 if(temp->left==NULL)
32.                 {
33.                     temp->left=note;
34.                     return;
35.                 }
36.                 else
37.                 {
38.                     temp=temp ->left;
39.                 }
40.             }
41.             if(value>temp->data)
42.             {
43.                 if(temp->right==NULL)
44.                 {
45.                     temp->right=note;
46.                     return;
47.                 }
48.                 else
49.                 {
50.                     temp=temp->right;
51.                 }
52.             }
53.         }
54.     }
55. }
56. void find(Note *note, int x)     //搜索的代码
57. {
58.     if(note !=NULL)
59.     {   if(x==note->data) return;
60.         if(x<note->data)
61.         {   printf("E");
62.             find(note -> left,x);
63.         }
64.         if(x>note->data)
65.         {   printf("W");
66.             find(note -> right,x);
67.         }
68.     }
69. }
70. int main()
71. {
72.     int N;
73.     scanf("%d",&N);
74.     while(N--)
75.     {   int n;
76.         scanf("%d",&n);
77.         Tree tree;
78.         tree.root=NULL;
79.         int a,i;
80.         for(i=0; i<n; i++)
81.         {
82.             scanf("%d",&a);
83.             insert(&tree,a); //构建搜索二叉树
84.         }
85.         int m;
86.         scanf("%d",&m);
87.         for(i=0;i<m;i++)
88.         {
89.             scanf("%d",&a);
90.             find(tree.root,a);  //查找此数
91.             printf("\n");
92.         }
93.     }
94.     return 0;
95. }