这道提树状数组球逆序数 关键在于 问有多少哥焦点 即使焦点在同一个位置
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
struct node
{
int x;
int y;
}a[1000005];
int c[1005];
int max1;
bool cmp(node a,node b){
return (a.x<b.x)||(a.x==b.x&&a.y<b.y);//判断 当一个点想多向点链接的时候 不算焦点
}
int lowbit(int x){
return x&(-x);
}
void insert(int x,int y){
while(x<=max1){
c[x]+=y;
x=x+lowbit(x);
}
}
long long sum(int x){
int t=0;
while(x>=1){
t+=c[x];
x=x-lowbit(x);
}
return t;
}
int main()
{
int te,m,n,k;
int kk=1;
scanf("%d",&te);
while(te--){
scanf("%d%d%d",&n,&m,&k);
max1=0;
for(int i=0;i<=1002;i++) c[i]=0;
for(int i=1;i<=k;i++)
{
scanf("%d%d",&a[i].x,&a[i].y);
if(a[i].y>max1)
max1=a[i].y;
}
sort(a+1,a+k+1,cmp);
long long ans=0;
for(int i=1;i<=k;i++){
ans+=(sum(max1)-sum(a[i].y));
insert(a[i].y,1);
}
printf("Test case %d: %lld\n",kk++,ans);
}
return 0;
}