hdu 5444 Elven Postman（水）

最新推荐文章于 2021-04-13 22:52:24 发布

weixin_33756418

最新推荐文章于 2021-04-13 22:52:24 发布

阅读量288

点赞数

文章标签： postman

原文链接：http://www.cnblogs.com/PersistFaith/p/4808288.html

版权

本文介绍了一种基于二叉树结构的邮件递送算法，该算法用于确定在一种特殊的二叉树结构（精灵树）中如何从根节点出发到达指定的房间。通过输入特定的序列，算法能够输出到达目标房间所需的移动指令。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

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

Output

For each query, output a sequence of move (

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

PS：水体，暴力可以过给出一棵树有n个点规定从东到西是1,2,3，。。。，n；

Q 个询问每次需要给出这个到达这个点的路线（向东走E 向西走 W ）

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
const int oo = 0x3f3f3f3f;
const int N = 1005;
typedef long long LL;
int ac[N], n;
int main()
{
    int T, i, j, Q, num;
    scanf("%d", &T);
    while(T--)
    {
        scanf("%d", &n);
        for(i = 1; i <= n; i++)
            scanf("%d", &ac[i]);
        scanf("%d", &Q);
        while(Q--)
        {
            scanf("%d", &num);
            for(i = 1; i <= n;)
            {
                if(ac[i] == num)break;
                if(ac[i] > num)
                {
                    printf("E");
                    j = i;
                    while(ac[i] >= ac[j] && i <= n-1)i++;
                }
                else
                {
                    printf("W");
                    j = i;
                    while(ac[i] <= ac[j] && i <= n-1)i++;
                }
            }
            printf("\n");
        }
    }
    return 0;
}

转载于:https://www.cnblogs.com/PersistFaith/p/4808288.html