20170110添加:
在最后总结的代码里第二句是有问题的,考虑arr1[]={1,5},index=2,调用的时候第三个参数为4,答案返回的指针是指向5的,因此有问题,还是自己手动写比较好。。。
试出来了,在此记录一下,能够找到的原理是数组是有序的,我们是需要在找的时候改变判断的方式即可,序关系,运用了仿函数
此处数组升序排列
#include<cstdio>
#include<algorithm>
#include<functional>
using namespace std;
int A[4010], B[4010], C[4010], D[4010], n, arr1[4000 * 4000 + 10], index, arr2[4000 * 4000 + 10],*up,*down;
long long sum;
int main(){
while (scanf("%d", &n) != EOF){
for (int i = 0; i < n; ++i)
scanf("%d%d%d%d", &A[i], &B[i], &C[i], &D[i]);
for (int i = 0; i < n; ++i)
for (int j = 0; j < n; ++j)
arr1[index] = A[i] + B[j], arr2[index] = C[i] + D[j], ++index;
sort(arr1, arr1 + index);
for (int i = 0; i < index; ++i){
up = upper_bound(arr1, arr1 + index, -arr2[i]);
down = upper_bound(arr1, arr1 + index, -arr2[i],less_equal<int>());
if (down != arr1 + index&&*(up - 1) == -arr2[i] && *(down) == -arr2[i])
sum += up - down;
//printf("%d %d %d %d %d\n", up - down, up - arr1, down - arr1, up[0], down[0]);
}
printf("%lld\n", sum);
sum = 0, index = 0;
}
}
下面两句第一句返回第一个大于-arr2[i]的指针,第二句返回最大的小于等于-arr2[i]的元素的地址
up = upper_bound(arr1, arr1 + index, -arr2[i]);
down = upper_bound(arr1, arr1 + index, -arr2[i],less_equal<int>());