UVA 11039 Building designing——水题

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int maxn = 5e5+10;
int T, n, a[maxn];
int iabs(int x) { return x > 0 ? x : -x; }
bool cmp(int x, int y) {
    return iabs(x) < iabs(y);
}
int main() {
    scanf("%d", &T);
    while (T--) {
        scanf("%d", &n);
        for (int i = 0; i < n; i++) scanf("%d", &a[i]);
        sort(a, a + n, cmp);
        int ans = 1, flag = a[0] >= 0 ? 1 : -1, maxv = iabs(a[0]);
        for (int i = 1; i < n; i++) {
            int t = a[i] > 0 ? 1 : -1;
            if (iabs(a[i]) > maxv && flag * t < 0) {
                maxv = a[i];
                flag = -flag;
                ans++;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}