ACM_Hailstone HOTPO

Hailstone HOTPO

Time Limit: 2000/1000ms (Java/Others)

Problem Description:

The hailstone sequence is formed in the following way:
(1) If n is even, divide it by 2 to get n'
(2) If n is odd, multiply it by 3 and add 1 to get n'
It is conjectured that for any positive integer number n, the sequence will always end in the repeating cycle: 4, 2, 1, 4, 2, 1,... Suffice to say , when n == 1, we will say the sequence has ended.
Write a program to determine the largest value in the sequence for a given n.
译文：以下面的方式形成在冰雹序列：
（1）如果n为偶数，除以2以获得N“ 
（2）如果n为奇数，乘以3，并添加1以获得N” 
据推测，对于任何正整数n，序列将总是以重复周期结束：4,2,1,4,2,1，......只要n == 1，我们就会说序列已经结束。
编写一个程序来确定给定n的序列中的最大值。

Input:

The first line of input contains a single integer P, (1<= P <= 100000), which is the number of data set s that follow. Each data set should be processed identically and independently.
Each data set consists of a single line of input consisting of two space separated decimal integers. The first integer is the data set number. The second integer is n, (1 <= n <= 100,000), which is the starting value.
译文：第一行输入包含一个整数P，（1 <= P <= 100000），它是后面的数据集的数量。每个数据集应该被相同和独立地处理。
每个数据集由一个由两个空格分隔的十进制整数组成的单行输入组成。第一个整数是数据集编号。第二个整数是n，（1 <= n <= 100,000），这是起始值。

Output:

For each data set there is a single line of output consisting of the data set number, a single space, and the largest value in the sequence starting at and including n. 
译文：对于每个数据集，都有一行输出，其中包含数据集编号，单个空间以及从n开始的序列中的最大值。 

Sample Input:

4
1 1
2 3
3 9999
4 100000

Sample Output:

1 1
2 16
3 101248
4 100000
解题思路：题目很简单，就是找序列中的最大值，按规则来查找。我们知道序列中要么是奇数要么是偶数，因而在循环中判断一下是否为奇数，若是，执行规则（2）后也是变为偶数，所以容易想到循环体内最后直接执行n/=2;加上查找序列中最大值的判断语句，水过。说明：题目中输入的个数p最多就有10^5个，假设有p个n是接近10^5，那么求序列中的最大值可能就会超时，因为循环节长度是不知道的，有可能更多的循环次数，所以后台数据有点水，这题真正的解法应该不是这样的，让菜鸡想想，待想到再回来修改！
贴一下水数据的AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int p,m,n,maxn;
    cin>>p;
    while(p--){
        cin>>m>>n;
        maxn=n;
        while(n!=1){
            if(n%2)n=n*3+1;
            if(maxn<n)maxn=n;
            n/=2;
        }
        cout<<m<<' '<<maxn<<endl;
    }
    return 0;
}

杭电hdu4484与此题一样，题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4484