Input
Output
Sample Input
6 -45 22 42 -16 -41 -27 56 30 -36 53 -37 77 -36 30 -75 -46 26 -38 -10 62 -32 -54 -6 45
Sample Output
5
Hint
#include <stdio.h>
#include <algorithm>
using namespace std;
#define N 4010
int a[N],b[N],c[N],d[N],ab[N*N],cd[N*N];
int main()
{
int n,pab,pcd,x,i,j,k;
scanf("%d",&n);
pab=pcd=x=0;
for(i=0;i<n;i++)
scanf("%d %d %d %d",&a[i],&b[i],&c[i],&d[i]);
for(i=0;i<n;i++)
for(j=0;j<n;j++)
{
ab[pab++]=a[i]+b[j];
cd[pcd++]=c[i]+d[j];
}
sort(cd,cd+pcd);
for(i=0;i<pab;i++)
{
int l=0,r=pcd-1,mid;
while(l<=r)
{
mid=(l+r)/2;
if(ab[i]==-cd[mid])
{
x++;
for(k=mid+1;k<pcd;k++)
if(ab[i]==-cd[k])
x++;
else break;
for(k=mid-1;k>=0;k--)
if(ab[i]==-cd[k])
x++;
else break;
break;
}
else if(ab[i]>-cd[mid])
r=mid-1;
else l=mid+1;
}
}
printf("%d\n",x);
}
原文:http://www.cnblogs.com/ljzh/p/6350243.html