二分&三分
关注
分享
扫一扫
zzcblogs
这个作者很懒，什么都没留下…
展开
-
Can you find it? （三分搜索
Can you find it?Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others)Total Submission(s): 1199 Accepted Submission(s): 383Problem Descri原创 2017-04-20 16:02:43 · 351 阅读 · 0 评论 -
Cable master (二分搜索)
Cable masterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 972 Accepted Submission(s): 344Problem Description原创 2017-04-20 19:43:06 · 437 阅读 · 0 评论 -
POJ3662 Telephone Lines 二分+最短路
Telephone LinesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3468 Accepted: 1245DescriptionFarmer John wants to set up a telephone line at his far原创 2017-07-29 15:12:23 · 295 阅读 · 0 评论 -
The Meaningless Game （二分 找答案）
A - The Meaningless Game #include #include #include #include #include using namespace std;bool bi(long long a) { long long left = 1; long long right = 1e6; while (left <= rig原创 2017-08-16 16:15:40 · 260 阅读 · 0 评论 -
Codeforces 831D Office Keys【二分 】
D. Office Keystime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n people and k keys on a straight line. Ev原创 2017-08-18 19:39:07 · 294 阅读 · 0 评论 -
nlogn求最长上升子序列长度（二分 找序列）
最长上升子序列O(nlogn)解法 在一列数中寻找一些数，这些数满足：任意两个数a[i]和a[j]，若i设dp[i]表示以i为结尾的最长递增子序列的长度，则状态转移方程为：dp[i] = max{dp[j]+1}, 1考虑两个数a[x]和a[y]，x按dp[t]=k来分类，只需保留dp[t]=k的所有a[t]中的最小值，设g[k]记录这个值，g[转载 2017-09-12 15:06:10 · 340 阅读 · 0 评论