#include <cstdio>
#include <algorithm>
using namespace std;
int n;
int a[500010];
int cmp(int x,int y)
{
return abs(x) < abs(y);
}
int get(int k)
{
int sum = 0,i = 0;
for(;i<n;)
{
k=-k;
if(k==1)
{
for(;a[i]<0 && i<n;i++);
}
else
{
for(;a[i]>0 && i<n;i++);
}
if(i<n)
sum++;
}
return sum;
}
int main()
{
int T=0;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=0;i<n;i++) scanf("%d",&a[i]);
sort(a,a+n,cmp);
printf("%d\n",max( get(1) , get(-1) ));
}
return 0;
}
转载于:https://www.cnblogs.com/ouqingliang/p/9245300.html