zcmu-1231: Antimonotonicity（思维）

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

注释：假设a,b,c,d四个数，a>b>c<d并且b>d;那么最长为acd，如果符合条件自然是要x变成y，如果不符合条件如上式c<b;那么使得d可以取的范围更大，所以x也要变成y；因此每一次判断x都要变成y。其实跟最长递增子序列的思想差不多。

代码：

#include<bits/stdc++.h>
using namespace std;
int t,n;
int main(){
	while(~scanf("%d",&t)){
		while(t--){
			scanf("%d",&n);
			int x,y,z=0,sum=1;
			scanf("%d",&x);
			for(int i=2;i<=n;i++){
				scanf("%d",&y);
					if(z==0){
						if(y<x){
							sum++;
							z=1;
						}
					}
					else{
						if(y>x){
							sum++;
							z=0;
						}
					}
					x=y;
				}
			printf("%d\n",sum);
	}
}
}