ZCMU—1231

1231: Antimonotonicity

Time Limit: 10 Sec   Memory Limit: 128 MB
Submit: 32   Solved: 9
[ Submit][ Status][ Web Board]

Description

I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to find a subsequence Mary of Fred that is as long as possible and has the property that:

   Mary[0] > Mary[1] < Mary[2] > Mary[3] < ...

Input

The first line of input will contain a single integer T expressed in decimal with no leading zeroes. T will be at most 50. T test cases will follow.

Each test case is contained on a single line. A line describing a test case is formatted as follows:

   n Fred[0] Fred[1] Fred[2] ... Fred[n-1].

where n and each element of Fred is an integer expressed in decimal with no leading zeroes. No line will have leading or trailing whitespace, and two adjacent integers on the same line will be separated by a single space. n will be at most 30000.

 

Output

For each test case, output a single integer followed by a newline --- the length of the longest subsequence Mary of Fred with the desired properties.

 

Sample Input

4

5 1 2 3 4 5

5 5 4 3 2 1

5 5 1 4 2 3

5 2 4 1 3 5

Sample Output

1

2

5

3

【分析】

题意很简单..就是单纯的求这个符合条件的序列，并且可以不用连续。

另外一点，如果没有任何符合条件的情况出现，那么最长的就是每个元素本身，长度就是1.

就是一个有峰值的最长序列，也就是中间的数向左右两边分别递减

做法很简单...把最长不下降序列改一下就OK了

【代码】

#include <stdio.h>
int main()
{
    int pp;scanf("%d",&pp);
    while (pp--)
    {
        int ans=1;
        int f=1,x,n;
        scanf("%d%d",&n,&x);
        for (int i=1;i<n;i++)
        {
            int y;scanf("%d",&y);
            if (f)
            {
                if (y<x){ans++;f=0;}
                x=y;
            }
            else
            {
                if (y>x){ans++;f=1;}
                x=y;
            }
        }
        printf("%d\n",ans);
    }
}