bit中存到考虑a[i]为止,区间上数字的出现的个数,为的是回来统计[1, a[i] - 1]大小范围的数
考虑到第i个人做裁判,设从a[1]到a[i - 1]有c[i]个比a[i]小的数,则就有i - 1 - c[i]个比a[i]大的数,
同理设从a[ i + 1]到a[n]有d[i] 个比a[i]小的数,则就有n - i - d[i]个比a[i]大的数
利用乘法原理,则i当裁判有c[i] * (n - i - d[i]) + d[i] * (i - 1 - c[i])种情况
sum用来求大小在[1, a[i] - 1]的数的个数,也就是对在这个范围内的数的个数进行一次累加和
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cstdlib>
using namespace std;
typedef long long ll;
ll T, n, maxn;
ll a[20005], c[20005], d[20005], bit[100005];
ll max(ll x, ll y) {
return x < y ? y : x;
}
ll lowbit(ll x) {
return x & (-x);
}
void add(ll x, ll y) {
//这里需要维护的树状数组的区间是从x到a[i]的最大值
for (ll i = x; i <= maxn; i += lowbit(i)) { //debug i <= maxn
bit[i] += y;
}
}
ll sum(ll x) {
ll ans = 0;
for (ll i = x; i > 0; i -= lowbit(i)) {
ans += bit[i];
}
return ans;
}
int main()
{
cin >> T;
while (T--) {
scanf("%lld", &n);
maxn = -1;
for (ll i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
maxn = max(maxn, a[i]); //debug
}
memset(bit, 0, sizeof(bit));
for (ll i = 1; i <= n; i++) {
add(a[i], 1);
c[i] = sum(a[i] - 1); //求到i为止出现过多少个小于a[i]的数
}
//反向同理求出d
memset(bit, 0, sizeof(bit));
for (ll i = n; i >= 1; i--) {
add(a[i], 1);
d[i] = sum(a[i] - 1);
}
ll ans = 0;
//乘法原理求出最终结果
for (ll i = 2; i <= n - 1; i++) {
ans = ans + c[i] * (n - i - d[i]) + d[i] * (i - c[i] - 1);
}
printf("%lld\n", ans);
}
return 0;
}