摘要： 计算A[i]+B[j]+C[k]=x转换为A[i]+B[i]=x-C[k] ，这样在A[i]+B[i]中二分查找，x-C[k] ，不会超时。题目来源：http://acm.hdu.edu.cn/showproblem.php?pid=2141Can you find it?Time Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 9548Accepted Submission(s): 2523Problem DescriptionGive you th 阅读全文