hdu 5444 Elven Postman

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.

刚刚看懂这个题目的时候就觉得这个不就是用书上的二叉树模板就可以解决的题目么，然而队友说这个题目如果都在一条线上，那莫树的层数会相当大，得处理过。于是乎最简单直接用一维数组的二叉树，就不能用了； 蓝后，我说这个用下指针的话那莫就是模板了。 然后沉默了一下，窝们没人会指针。于是乎，窝们默默的用结构体来做了

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct Tree{
    int v,lson,rson;
};
Tree t[1100];
char s[1100];
int n;
void init()
{
    for(int i = 1; i <= n; i++)
    {
        t[i].lson = t[i].rson = -1;
    }
}
void slove( int x, int root)
{
    int u = t[x].v, v = t[root].v;
    if(u > v)
    {
        if(t[root].rson == -1)
            t[root].rson = x;
        else
            slove(x,t[root].rson);
    }
    else
    {
        if(t[root].lson == -1)
            t[root].lson = x;
        else
            slove(x,t[root].lson);
    }
    return;
}
void findl(int x,int root,int cnt)
{
    int u = t[root].v;
    if(x == u) { s[cnt] = '\0'; return; }
    if(x > u)
    {
        s[cnt] = 'W';
        cnt++;
        findl(x,t[root].rson,cnt);
    }
    else
    {
        s[cnt] = 'E';
        cnt++;
        findl(x,t[root].lson,cnt);
    }
    return ;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
      scanf("%d",&n);
      init();
      for(int i = 1; i <= n; i++) scanf("%d",&t[i].v);
      for(int i = 2; i <= n; i++)
      {
          slove(i,1);
      }
      int q;
      scanf("%d",&q);
      for(int i = 1; i <= q; i++)
      {
        int x;
        scanf("%d",&x);
        if(x == t[1].v)
            printf("\n");
        else
        {
            findl(x,1,0);
            printf("%s\n",s);
        }
      }
    }
    return 0;
}