SZU : A11 Sequence

Description

We are given a integer sequence, your job is find the length of the longest contiguous subsequence that is strictly increasing or strictly decreasing.

Input

• First number , represent how many test cases.
• For each test case the first number is .
• Then  positive integers are followed, all of them are less than 101.

Output

For each test case output the answer in one line.

Sample Input

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

Sample Output

1
3
4

思路： 用2个数组存取递增递减序列，并且浪费点空间节省效率的方法去做。

 #include<stdio.h>
 int main()
 {
     int i,j,test,num,len,A[],B[],C[];
     scanf("%d",&test);
     for(i=;i<test;i++)
     {
         scanf("%d",&num);
         for(j=;j<num;j++)
             scanf("%d",&C[j]);
         A[]=;
         B[]=;
         for(j=;j<num;j++)
         {
             if(C[j]>C[j-])
             {
                 A[j]=A[j-]+;
                 B[j]=;
             }
             if(C[j]<C[j-])
             {
                 A[j]=;
                 B[j]=B[j-]+;
             }
             if(C[j]==C[j-]){
                 A[j]=;
                 B[j]=;
             }
         }
         for(j=,len=;j<num;j++)
         {
             if(A[j]>len)    len=A[j];
             if(B[j]>len)      len=B[j];
         }
         printf("%d\n",len);
     }
     return ;
 }