注册 登录  
 加关注
   显示下一条  |  关闭
温馨提示!由于新浪微博认证机制调整,您的新浪微博帐号绑定已过期,请重新绑定!立即重新绑定新浪微博》  |  关闭

东月之神

在单纯的观念里面,生命就容易变得比较深刻!

 
 
 

日志

 
 
关于我

别驻足,梦想要不停追逐,别认输,熬过黑暗才有日出,要记住,成功就在下一步,路很苦,汗水是最美的书!

网易考拉推荐

zstu Passing the Message  

2010-05-14 10:35:51|  分类: ACM |  标签: |举报 |字号 订阅

  下载LOFTER 我的照片书  |

Description

What a sunny day! Let’s go picnic and have barbecue! Today, all kids in “Sun Flower” kindergarten are prepared to have an excursion. Before kicking off, teacher Liu tells them to stand in a row. Teacher Liu has an important message to announce, but she doesn’t want to tell them directly. She just wants the message to spread among the kids by one telling another. As you know, kids may not retell the message exactly the same as what they was told, so teacher Liu wants to see how many versions of message will come out at last. With the result, she can evaluate the communication skills of those kids.
Because all kids have different height, Teacher Liu set some message passing rules as below:
1) She tells the message to the tallest kid.
2) Every kid who gets the message must retell the message to his “left messenger” and “right messenger”.
3) A kid’s “left messenger” is the kid’s tallest “left follower”.
4) A kid’s “left follower” is another kid who is on his left, shorter than him, and can be seen by him. Of course, a kid may have more than one “left follower”.
5) When a kid looks left, he can only see as far as the nearest kid who is taller than him.
6) The definition of “right messenger” is similar to the definition of “left messenger” except all words “left” should be replaced by words “right”.
For example, suppose the height of all kids in the row is 4, 1, 6, 3, 5, 2 (in left to right order). In this situation , teacher Liu tells the message to the 3rd kid, then the 3rd kid passes the message to the 1st kid who is his “left messenger” and the 5th kid who is his “right messenger”, and then the 1st kid tells the 2nd kid as well as the 5th kid tells the 4th kid and the 6th kid.
Your task is just to figure out the message passing route.

Input

The first line contains an integer T indicating the number of test cases, and then T test cases follows.
Each test case consists of two lines. The first line is an integer N (0< N <= 50000) which represents the number of kids. The second line lists the height of all kids, in left to right order. It is guaranteed that every kid’s height is unique and less than 231 – 1 .

Output

For each test case, print “Case t:” at first ( t is the case No. starting from 1 ). Then print N lines. The ith line contains two integers which indicate the position of the ith (i starts form 1 ) kid’s “left messenger” and “right messenger”. If a kid has no “left messenger” or “right messenger”, print ‘0’ instead. (The position of the leftmost kid is 1, and the position of the rightmost kid is N)

Sample Input

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

Sample Output

Case 1:
0 3
0 0
2 4
0 5
0 0
Case 2:
0 2
0 0
1 4
0 0
3 0
一开始以为要用线段树或者RMQ算法来实现,带着尝试的心理写了一个模拟的。居然可以过,呵呵。。
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct Node
{
 int h;
 int l,r;
};
bool hash[50001];
int main()
{
 int t, i, ii, n;
 while(scanf("%d", &t) != EOF)
 {
  for(ii = 1; ii <= t; ii++)
  {
   Node s[50001];
   memset(hash, 0, sizeof(hash));
   scanf("%d", &n);
   int maxn = 0, m = n, pos = 0;
   for(i = 1; i <= n; i++)
   {
    scanf("%d", &s[i].h);
    s[i].l = s[i].r = 0;
    if(s[i].h > maxn)
    {
     pos = i;
     maxn = s[i].h;
    }
   }
   hash[pos] = 1;
   printf("Case %d:\n", ii);
   m--;
   int a[50001], jj = 1, l;
   a[0] = pos;
   for(l = 0; m > 0; l++)
   {
    maxn = a[l];
    int ma = 0, k;
    for(i = maxn-1; i >= 0; i--)
    {
     if(s[i].h > s[maxn].h) break;
     if(!hash[i] && ma < s[i].h)
     {
      k = i;
      ma = s[i].h;
     }
    }
    if(ma){a[jj++] = k; s[maxn].l = k;m--, hash[k] = 1;}
    ma = 0;k = 0;
    for(i = maxn+1; i <= n; i++)
    {
     if(s[i].h > s[maxn].h) break;
     if(!hash[i] && ma < s[i].h)
     {
      k = i;
      ma = s[i].h;
     }
    }
    if(ma){a[jj++] = k; s[maxn].r = k;m--, hash[k] = 1;}
   }
   for(i = 1; i <= n; i++)
    printf("%d %d\n", s[i].l, s[i].r);
  }
 }
return 0; 
}

  评论这张
 
阅读(117)| 评论(0)
推荐 转载

历史上的今天

评论

<#--最新日志,群博日志--> <#--推荐日志--> <#--引用记录--> <#--博主推荐--> <#--随机阅读--> <#--首页推荐--> <#--历史上的今天--> <#--被推荐日志--> <#--上一篇,下一篇--> <#-- 热度 --> <#-- 网易新闻广告 --> <#--右边模块结构--> <#--评论模块结构--> <#--引用模块结构--> <#--博主发起的投票-->
 
 
 
 
 
 
 
 
 
 
 
 
 
 

页脚

网易公司版权所有 ©1997-2017