查找
查找
Wonder-King
有好奇心,什么都想学一点。
展开
-
HDU2141 Can you find it? (二分查找)
Give you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj+Ck = X. InputThere a...原创 2018-07-12 09:11:12 · 201 阅读 · 0 评论 -
HDU2199 Can you solve this equation? (二分查找)
Can you solve this equation? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12794 Accepted Submission(s): 5715 Problem Description Now...原创 2018-07-12 09:31:12 · 149 阅读 · 0 评论 -
51Nod1001 数组中和等于K的数对(二分查找)
刚看到这个题就想到了全部加一遍不就行了吗,就是下面的程序,结果有一个超时了。 #include<iostream> #include<algorithm> using namespace std; typedef long long ll; int main() { ll a[50001]; int i,j,k,n; cin>>k>>n;...原创 2018-11-16 15:58:18 · 214 阅读 · 0 评论 -
51Nod1090 3个数和为0(二分查找)
这道题和基础题里面的1001 数组中和等于K的数对这道题差不多。 思路:先排升序,让数组里的两个数a[i]a[j]相加,然后在数组下标j之后找(0-a[i[-a[j])。 #include<iostream> #include<cstring> #include<algorithm> using namespace std; long long a[100...原创 2018-11-17 16:22:07 · 327 阅读 · 0 评论 -
HDU1597 find the nth digit
find the nth digit Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 16138Accepted Submission(s): 5108 Problem Description 假设: S1 = 1 S2 =...原创 2019-03-15 11:51:15 · 219 阅读 · 0 评论