【树状数组】poj1794

两组士兵把绳子扔向城墙

每组士兵绳子之间相互不交叉

两组之间可能会交叉

问交叉数目

先整体按照农民升序然后城墙降序排序

再用树状数组求逆序对数就好了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>
using namespace std;
int n,m,ans,c[200100];
struct rec
{
	int x,y;
}ren[100100];
bool cmp(rec a,rec b) 
{
	if (a.x!=b.x) return a.x<b.x;
	return a.y>b.y;
}
int lowbit(int x) {return x&(-x);}
int getsum(int x)
{
	int tmp=0;
	while (x>0)
	{
		tmp+=c[x];
		x-=lowbit(x);
	}
	return tmp;
}
int insert(int x)
{
	while (x<=n+m)
	{
		c[x]+=1;
		x+=lowbit(x);
	}
}
int main()
{
	freopen("test.in","r",stdin);
	int t,x;
	scanf("%d",&t);
	for (int ci=t;t;t--)
	{
		memset(c,0,sizeof(c));
		ans=0;
		scanf("%d%d",&n,&m);
		for (int i=1;i<=n+m;i++)
			scanf("%d%d",&ren[i].x,&ren[i].y);
		sort(ren+1,ren+n+m+1,cmp);
		for (int i=1;i<=n+m;i++)
		{
			ans+=getsum(n+m)-getsum(ren[i].y-1);
			insert(ren[i].y);
		}
		printf("Scenario #%d:\n",ci-t+1);
		printf("%d\n",ans);
		printf("\n");
	}
	return 0;
}