(1.1.10)UVA 11039 Building designing(模拟题)

/*
 * UVA_11039.cpp
 *
 *  Created on: 2013年10月7日
 *      Author: Administrator
 */


#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000000;
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		int n;
		scanf("%d",&n);
		/**
		 * arr[i] :第i层的大小
		 * number[i] :大小为i的楼层的眼色
		 */
		int arr[n];
		bool number[maxn];
		memset(number,false,sizeof(number));
        memset(arr,0,sizeof(0));

		int i;
		for(i = 0 ; i < n ; ++i){
			scanf("%d",&arr[i]);

			if(arr[i] < 0){
				number[-arr[i]] = true;
				arr[i] = -arr[i];
			}
		}

		sort(arr,arr + n );

		bool flag = number[arr[n - 1]];
		int ans = 1;
		for(i = n - 2 ; i >= 0 ; --i){
			if(number[arr[i]] != flag ){
				ans++;
				flag = number[arr[i]];
			}
		}

		printf("%d\n",ans);
	}
}