Uva 11039(排序+模拟)

#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
int a[500005],b[500005];
 int i,j,n,an,bn,x,t;
int work(int flag)
{        
	int	ans=1;
 	i=j=0;
  	while (i<an&&j<bn)
    {
    	if (flag)
        {
            while (a[i]>b[j]&&j<bn) j++;
            if (j!=bn) ans++;
            flag=0;
        }
        else
        {
            while (a[i]<b[j]&&i<an) i++;
            if (i!=an)  ans++;
            flag=1;
        }
    }
    return ans;
}
int main(int argc, char *argv[])
{
   int maxl;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%d",&n);
        an=bn=0;
        while (n--)
        {
            scanf("%d",&x);
            if (x>0) a[an++]=x;
            else b[bn++]=-x;
        }
        if (!bn||!an) printf("1\n");
        else
        {
            sort(a,a+an);
            sort(b,b+bn);
            maxl=max(work(1),work(0));
            printf("%d\n",maxl);
        }
    }
    return 0;
}