Uva 11039 Building designing

題目來源：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1980

	#include <iostream>
	#include <algorithm>
	#include <cstdio>
	#include <cmath>
	using namespace std;
	bool cmp(int a,int b){
	return abs(a)>abs(b);
	}
	int main(){
	int T,p,a[500001],sum;
	bool flag;
	scanf("%d",&T);
	while(T--){
	sum = 1;
	scanf("%d",&p);
	for(int i = 0; i < p ;i++){
	scanf("%d",&a[i]);
	}
	sort(a,a+p,cmp);
	if (a[0]>0) flag = true;
	else flag = false;
	for(int i = 1;i<p;i++){
	if(flag){
	if(a[i]<0){
	flag = false;
	sum++;
	}
	}
	else{
	if(a[i]>0){
	flag = true;
	sum++;
	}
	}
	}
	printf("%d\n",sum);
	}
	}

view raw 11039.cpp hosted with ❤ by GitHub