芒果布丁

摘要： HDOJ 4334 Trouble If we have two sorted lists of integers A and B, we can easily find in linear time by keeping two pointers if there are a in A and b in B such that a+b=c (c is given). Now, for this problem, we create a sorted list of all sums for S[0] and S[1] (call it M[0]), and a sorted list o.. 阅读全文