#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=32010;
int sum[15010],tr[N];
int lowbit(int x)
{
return -x&x;
}
void add(int x,int k)
{
for(int i=x;i<N;i+=lowbit(i))
tr[i]+=k;
}
int query(int x)
{
int res=0;
for(int i=x;i;i-=lowbit(i))
res+=tr[i];
return res;
}
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
int x,y;
cin>>x>>y;
x++;
sum[query(x)]++;
// cout<<query(x)<<" ";
add(x,1);
}
// puts(" ");
for(int i=0;i<n;i++)
cout<<sum[i]<<endl;
}
技巧:树状数组中存的是数值的大小1~N,不是数组中的值
先查询,然后再add,添加是给tr[u]+1;
可以求数组中后面有多少数比他小,即逆序数,先查询然后将数组反向add进树状数组;
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1000010;
int n;
int h[N], tr[N];
int sum[N];
int lowbit(int x)
{
return x & -x;
}
void add(int x, int v)
{
for (int i = x; i < N; i += lowbit(i)) tr[i] += v;
}
int query(int x)
{
int res = 0;
for (int i = x; i; i -= lowbit(i)) res += tr[i];
return res;
}
int main()
{
scanf("%d", &n);
for (int i = 0; i < n; i ++ ) scanf("%d", &h[i]), h[i] ++ ;
// 求每个数前面有多少个数比它大
for (int i = 0; i < n; i ++ )
{
sum[i] = query(N - 1) - query(h[i]);
add(h[i], 1);
}
// 每个数后面有多少个数比它小
memset(tr, 0, sizeof tr);
for (int i = n - 1; i >= 0; i -- )
{
sum[i] += query(h[i] - 1);
add(h[i], 1);
}
LL res = 0;
for (int i = 0; i < n; i ++ ) res += (LL)sum[i] * (sum[i] + 1) / 2;
cout << res << endl;
return 0;
}