二分
文章平均质量分 86
键盘里的青春
加油~
展开
-
poj 2456 Aggressive cows (最小值最大化二分问题)
Aggressive cowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11952 Accepted: 5842DescriptionFarmer John has built a new long barn, with N (2 His原创 2016-11-27 21:31:20 · 2822 阅读 · 1 评论 -
CodeForces 748E. Santa Claus and Tangerines 题解(递推or二分)
Santa Claus has n tangerines, and the i-th of them consists of exactly ai slices. Santa Claus came to a school which has k pupils. Santa decided to treat them with tangerines.However, there ca原创 2017-03-11 22:45:49 · 485 阅读 · 0 评论 -
三分算法概念
我们都知道 二分查找 适用于单调函数中逼近求解某点的值。如果遇到凸性或凹形函数时,可以用三分查找求那个凸点或凹点。下面的方法应该是三分查找的一个变形。如图所示,已知左右端点L、R,要求找到白点的位置。思路:通过不断缩小 [L,R] 的范围,无限逼近白点。做法:先取 [L,R] 的中点 mid,再取 [mid,R] 的中点 mmid,通过比较 f(转载 2017-04-12 11:46:15 · 1124 阅读 · 0 评论 -
qduoj 153 cfenglv的一道简单签到题 (二分+分解因子)
cfenglv的一道简单签到题发布时间: 2017年6月11日 17:59 最后更新: 2017年6月11日 18:11 时间限制: 4000ms 内存限制: 128M描述据说,julyc决定给学弟学妹出一场月赛,于是他脑中浮现了许多很棒棒的出题创意。而cfenglv恰巧在机房,于是他把一道题的创意说给了cfenglv听:求区间gcd(最大公约数)大原创 2017-06-12 16:00:33 · 426 阅读 · 0 评论 -
Codeforces 739B Alyona and a tree (树上差分+二分)
D. Alyona and a treetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlyona has a tree with n vertices. The原创 2017-04-19 22:44:49 · 1121 阅读 · 0 评论 -
【CodeForces 626E】Simple Skewness (三分)
思路转自:http://www.cnblogs.com/flipped/p/5211693.html题意给出n个数的集合,求一个 (平均数-中位数)最大 (偏度最大)的子集,输出子集元素个数和各个元素(任意顺序)。分析因为是子集,所以不一定是连续的序列。然后我们有下面几个结论。1.最大偏度一定≥0 因为一个元素时,偏度为0。2.最大偏度子集必定有元素个数为奇数原创 2017-08-31 15:27:32 · 343 阅读 · 0 评论 -
POJ 2112 Optimal Milking (二分+最大流/多重匹配) && POJ 2391 Ombrophobic Bovines( 二分+拆点+最大流)
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000KTotal Submissions: 17940 Accepted: 6421Case Time Limit: 1000MSDescriptionFJ has moved his K (1 <= K原创 2017-07-23 15:26:56 · 426 阅读 · 0 评论 -
HDU 5726 GCD (rmq+二分 or 线段树 维护区间gcd)
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4325 Accepted Submission(s): 1543Problem DescriptionGive you a sequence o原创 2017-09-19 17:30:01 · 591 阅读 · 0 评论 -
HDU 5875 Function (ST表+二分 or 线段树)
Problem Description The shorter, the simpler. With this problem, you should be convinced of this truth. You are given an array A of N postive integers, and M queries in the form (l,r).原创 2017-09-03 14:18:15 · 344 阅读 · 0 评论 -
hdu 5884 Sort 二分+K哈夫曼树(解决不单调问题) 队列优化
SortTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3231 Accepted Submission(s): 801Problem DescriptionRecently, Bob has just原创 2017-09-20 13:28:24 · 333 阅读 · 0 评论 -
☆HDU 5976 Detachment 详细题解(贪心+逆元+前缀和,积)
Detachment 解题思路:【题意】给定一个自然数x,让你给出一种拆分方式x=a1+a2+...(ai≠aj),使得每个小部分的乘积s=a1*a2*...最大【类型】贪心构造【分析】此题关键在于得出如何能使乘积s最大按照以往经验,必然是取一段连续自然数能够使得乘积最大,而这段连续自然数可从2开始(为原创 2016-12-07 21:04:54 · 3114 阅读 · 2 评论 -
POJ 3233-Matrix Power Series 详细题解 (等比矩阵)
Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 20309 Accepted: 8524DescriptionGiven a n × n matrix A and a positive integer原创 2017-03-11 22:30:12 · 525 阅读 · 0 评论 -
codeforces 672D D. Robin Hood (二分+思维)
D. Robin Hoodtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe all know the impressive story of Robin Hood. Robin原创 2017-03-11 12:47:34 · 681 阅读 · 0 评论 -
poj 3111 K Best(二分)
K BestTime Limit: 8000MS Memory Limit: 65536KTotal Submissions: 9341 Accepted: 2423Case Time Limit: 2000MS Special JudgeDescriptionDemy has n jewels原创 2016-11-27 21:34:15 · 664 阅读 · 0 评论 -
Codeforces 676C - Vasya and String 详解(二分前缀和+尺取两种写法)
C. Vasya and Stringtime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputHigh school student Vasya got a stri原创 2017-01-16 23:35:10 · 1326 阅读 · 0 评论 -
HDU 1597 find the nth digit(水规律+二分)
find the nth digitTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12609 Accepted Submission(s): 3819Problem Description假设:S原创 2017-01-22 23:16:24 · 588 阅读 · 0 评论 -
Codeforces 645C:Enduring Exodus (二分+前缀和)
C. Enduring Exodustime limit per test 2 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputIn an attempt to escape the Mischiev原创 2017-03-02 00:16:56 · 554 阅读 · 0 评论 -
HDU 5248 序列变换 详解 (二分+贪心)
序列变换Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1033 Accepted Submission(s): 471Problem Description给定序列A={A1,A2,...,An},原创 2017-03-02 10:55:11 · 775 阅读 · 0 评论 -
CodeForces 363D Renting Bikes (二分+贪心)
D. Renting Bikestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA group of n schoolboys decided to ride bik原创 2017-02-24 13:06:37 · 587 阅读 · 0 评论 -
codeforces 366D Dima and Trap Graph 题解(搜索+剪枝or二分+枚举)
D. Dima and Trap Graphtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima and Inna love spending time tog原创 2017-03-08 15:22:46 · 672 阅读 · 0 评论 -
LightOJ - 1048 Conquering Keokradong (二分)输出路径
LightOJ - 1048Conquering KeokradongTime Limit: 1000MSMemory Limit: 32768KB64bit IO Format: %lld & %lluSubmit StatusDescriptionThis winter we are going on a trip to Ba原创 2017-03-05 12:19:57 · 545 阅读 · 0 评论 -
POJ 3104 Drying (二分)
DryingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9440 Accepted: 2407DescriptionIt is very hard to wash and especially to dry clothes in win原创 2017-03-09 14:11:06 · 732 阅读 · 0 评论 -
POJ 3685 Matrix 详细题解 (二分嵌套)
MatrixTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 5489 Accepted: 1511DescriptionGiven a N × N matrix A, whose element in the i-th row and原创 2017-03-06 11:41:27 · 1033 阅读 · 0 评论 -
牛客练习赛13 B(预处理+二分)
题目描述定义一个数字为幸运数字当且仅当它的所有数位都是4或者7。比如说,47、744、4都是幸运数字而5、17、467都不是。定义next(x)为大于等于x的第一个幸运数字。给定l,r,请求出next(l) + next(l + 1) + ... + next(r - 1) + next(r)。输入描述:两个整数l和r (1 <= l <= r <= 1000,000,000)。...原创 2018-03-16 23:39:40 · 199 阅读 · 0 评论