[HDOJ5444]Elven Postman

 1 #include <algorithm>
 2 #include <iostream>
 3 #include <iomanip>
 4 #include <cstring>
 5 #include <climits>
 6 #include <complex>
 7 #include <fstream>
 8 #include <cassert>
 9 #include <cstdio>
10 #include <bitset>
11 #include <vector>
12 #include <deque>
13 #include <queue>
14 #include <stack>
15 #include <ctime>
16 #include <set>
17 #include <map>
18 #include <cmath>
19 
20 using namespace std;
21 
22 typedef struct Node {
23     Node* left;
24     Node* right;
25     int data;
26     Node() { left = NULL; right = NULL; }
27 }Node;
28 
29 Node* insert(Node* cur, int data) {
30     if(cur == NULL) {
31         cur = new Node();
32         cur->data = data;
33         return cur;
34     }
35     if(data > cur->data) {
36         cur->right = insert(cur->right, data);
37     }
38     else {
39         cur->left = insert(cur->left, data);
40     }
41     return cur;
42 }
43 
44 void solve(Node* cur, int x) {
45     if(cur == NULL ||cur->data == x) {
46         printf("\n");
47         return ;
48     }
49 
50     if(x > cur->data) {
51         printf("W");
52         return solve(cur->right, x);
53     }
54     if(x < cur->data) {
55         printf("E");
56         return solve(cur->left, x);
57     }
58 }
59 
60 int n, q, x, tmp;
61 
62 int main() {
63     //freopen("input", "r", stdin);
64     int T;
65     scanf("%d", &T);
66     while(T--) {
67         scanf("%d", &n);
68         Node* root = NULL;
69         for(int i = 0; i < n; i++) {
70             scanf("%d", &tmp);
71             root = insert(root, tmp);
72         }
73         scanf("%d", &q);
74         while(q--) {
75             scanf("%d", &x);
76             solve(root, x);
77         }
78     }
79     return 0;
80 }