Ural1090-In the Army Now

有k行n列，求逆序对数最多的那一行的序号。

#include <cstdio>
#include <cstring>

const int maxn = 10000 + 5;
const int maxk = 20 + 5;

int a[maxk][maxn];

int fw[maxn];

int n, k;

inline int lowbit(int x) {
    return x & -x;
}

void add(int x, int delta) {
    for (int i = x; i <= n; i += lowbit(i)) {
        fw[i] += delta;
    }
}

int sum(int x) {
    int ret = 0;
    for (int i = x; i > 0; i -= lowbit(i)) {
        ret += fw[i];
    }
    return ret;
}

int main(int argc, char const *argv[]) {
    scanf("%d%d", &n, &k);
    int max = 0, ans = 1;
    for (int i = 0; i < k; i++) {
        memset(fw, 0, sizeof(fw));
        int cnt = 0;
        for (int j = 0; j < n; j++) {
            scanf("%d", &a[i][j]);
            cnt += j - sum(a[i][j]);
            add(a[i][j], 1);
        }
        if (cnt > max) {
            max = cnt;
            ans = i + 1;
        }
    }
    printf("%d\n", ans);

    return 0;
}