Lancer

二分查找 看完题目以后感觉无从下手 看了别人的解题思路后 感觉顿时明白了 许多 首先将ab 数组的和整合成一个数组 sab 然后在利用公式sab[i] + c[j] = x; 即sab[i] = x - c[j];然后就进行二分查找 #include<algorithm>#include<iostream>#include<string.h>using namespace std;int

Cup Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1022 Accepted Submission(s): 365Problem Description The WHU ACM Team has a big cup, with whi

Line belt Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 629 Accepted Submission(s): 325 Problem Description In a two-dimensional plane there