折半枚举--poj2785

Language: Default 4 Values whose Sum is 0 Time Limit: 15000MS   Memory Limit: 228000K Total Submissions: 13302   Accepted: 3750 Case Time Limit: 5000MS Description The SUM problem can be formulated as follows: given four lists A, B, C, D of integer values, compute how many quadruplet (a, b, c, d ) ∈ A x B x C x D are such that a + b + c + d = 0 . In the following, we assume that all lists have the same size n . Input The first line of the input file contains the size of the lists n (this value can be as large as 4000). We then have n lines containing four integer values (with absolute value as large as 2 28  ) that belong respectively to A, B, C and D . Output For each input file, your program has to write the number quadruplets whose sum is zero. 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 有时候，问题的规模较大，无法枚举所有元素的集合，但能枚举一半元素的集合的组合，此时将问题拆成两半枚举，再二分查找，合并结果。 下面是AC代码： #include<iostream> #include<cstdio> #include<algorithm> using namespace std; const int maxn=4005; int a[maxn],b[maxn],c[maxn],d[maxn]; int cd[maxn*maxn]; int n; void solve() { for(int i=0; i<n; i++) for(int j=0; j<n; j++) cd[i*n+j]=c[i]+d[j]; sort(cd,cd+n*n); long long res=0; for(int i=0; i<n; i++) for(int j=0; j<n; j++) { int x=-(a[i]+b[j]); res+=upper_bound(cd,cd+n*n,x)-lower_bound(cd,cd+n*n,x); } cout<<res<<endl; } int main() { //freopen("in.txt","r",stdin); while(cin>>n) { for(int i=0; i<n; i++) cin>>a[i]>>b[i]>>c[i]>>d[i]; solve(); } return 0; }