

Series 2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 875 Accepted Submission(s): 285 Problem Description Let A be an integral series {A_{1}, A_{2}, . . . , A_{n}}. The zeroorder series of A is A itself. The firstorder series of A is {B_{1}, B_{2}, . . . , B_{n1}, where B_{i} = A_{i+1}  A_{i}. The ithorder series of A is the firstorder series of its (i  1)thorder series (2<=i<=n  1). We say A is monotonic iff A_{1}<=A_{2}<=. . . <=A_{n} or A_{1}>= A_{2} >=. . . >= A_{n}. A is kthorder monotonic iff all ithorder series (0<=i<=k) are monotonic, and (k + 1)thorder are not. Specially, if the zeroorder series of A is not monotonic, then A is named ugly series. If all ithorder (0<=i<=n  1) series of A are monotonic, then A is a nice series. Given A, determine whether it’s a ugly series or nice series. If both are not, determine k. Input The input consists of several test cases. The first line of input gives the number of test cases T (T<=50). For each test case: The first line contains a single integer n(1<=n<=10^{5}), which denotes the length of series A. The second line consists of n integers, describing A_{1}, A_{2}, . . . , A_{n}. (0<=A_{i}<=2^{60}) Output For each test case, output either ugly series, nice series or a single integer k. Sample Input
Sample Output
Author BUPT Source  
