题目链接:
http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1278
题解:
二分好题
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define met(a,b) memset(a,b,sizeof(a))
#define inf 0x3f3f3f3f
const int mod = 1e9+7;
typedef long long ll;
const int maxn =5*1e4+10;
struct node
{
int l,r;
}num[maxn];
int cmp(node a,node b)
{
if(a.l==b.l)
return a.r<b.r;
return a.l<b.l;
}
int find(int l,int r,int x)
{
int m=0;
while(l<=r)
{
m=(l+r)/2;
if(num[m].l<x)
{
l=m+1;
}
else
r=m-1;
}
return l;
}
int main()
{
int n;
while(cin>>n)
{
met(num,0);
for(int i=0;i<n;i++)
{
int p,r;
cin>>p>>r;
num[i].l=p-r;
num[i].r=p+r;
}
sort(num,num+n,cmp);
int ans=0;
for(int i=0;i<n-1;i++)
{
ans+=n-find(i+1,n-1,num[i].r+1);
}
printf("%d\n",ans);
}
}