数据结构:二分查找
数据结构:二分查找
LSD20164388
如果你过几天就忘了,那么你并没有真正的掌握。
展开
-
2019-2020 ICPC香港 C. Constructing Ranches (点分治)
传送门题意TTT组数据,每组数据给你一个正整数nnn,然后每个点的权值aia_iai,再给你n−1n-1n−1条无向边(ui,vi)(u_i,v_i)(ui,vi),保证构成一棵树。求有多少条合法的路径(相当于多少个点对),使得路径上经过的所有点的权值可以构成一个简单多边形。数据范围:1⩽n⩽2×105,1⩽ai⩽1091\leqslant n\leqslant 2\times10^5,1\leqslant a_i\leqslant 10^91⩽n⩽2×105,1⩽ai⩽1091⩽ui,原创 2020-12-15 20:11:37 · 630 阅读 · 0 评论 -
Educational Codeforces Round 90 (Rated for Div. 2) F. Network Coverage(二分 or 思维)
F. Network Coveragetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe government of Berland decided to improve network coverage in his country. Berland has a unique structure: the cap原创 2020-07-01 20:52:15 · 346 阅读 · 0 评论 -
Codeforces Round #651 (Div. 2) F2. The Hidden Pair (Hard Version) (二分+剪枝)
F2. The Hidden Pair (Hard Version)time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputNote that the only difference between the easy and hard version is the constraint on the number of que原创 2020-06-24 20:03:43 · 277 阅读 · 0 评论 -
HDU 6231 K-th Number (2017CCPC哈尔滨 B)离散化+二分
K-th NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 3111Accepted Submission(s): 1126Problem DescriptionAlice are given an arrayA[1..N]withNnumbers.Now Alice want to build an...原创 2020-06-16 22:30:22 · 226 阅读 · 0 评论 -
2014-2015 ACM-ICPC, Asia Xian Regional Contest Problem C. The Problem Needs 3D Arrays(网络流之最大密度子图)
题意:给你一个长度为n(<=100)的序列T,S为T的任意子序列,r(S)表示子序列S(不连续)中的逆序对数,l(S) 表示S的长度,求出 r(S) / l(S) 的最大值。思路:将r(S)看成边,l(S)看成点,问题转化为求 E / V 的最大值。经典的最大密度子图问题。利用类似0/1分数规划的思想,二分答案,设为mid,则有E /V=mid 即E=V*mid。即使E-V*mid趋近于0。问题再转化为求最大权闭合图。最大权闭合图参考:https://blog.csdn.ne.原创 2020-06-06 22:06:58 · 277 阅读 · 0 评论 -
Good Bye 2018 E. New Year and the Acquaintance Estimation
E. New Year and the Acquaintance Estimationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob is an active user of the social n...原创 2019-01-08 21:54:29 · 284 阅读 · 0 评论 -
HDU 5493 Queue 二分+树状数组
QueueTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1553 Accepted Submission(s): 798 Problem DescriptionN people numbered from 1 to ...原创 2019-01-16 10:59:01 · 385 阅读 · 0 评论 -
ZOJ 3187 Inviting Friends (二分+完全背包)
Inviting FriendsTime Limit: 1 Second Memory Limit: 32768 KBYou want to hold a birthday party, inviting as many friends as possible, but you have to prepare enough food for them. For each pers...原创 2019-02-17 21:10:41 · 481 阅读 · 0 评论 -
HDU 4282 A very hard mathematic problem (暴力枚举+二分+各种剪枝)
A very hard mathematic problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8579 Accepted Submission(s): 2624 Problem Description ...原创 2019-02-17 21:27:02 · 452 阅读 · 0 评论 -
CodeForces 394 D. Physical Education and Buns(双二分)
D. Physical Education and Bunstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe Physical education teacher at SESC is a sort o...原创 2019-02-13 08:51:28 · 361 阅读 · 0 评论 -
2019年2月12日训练日记
二分法小结:1、遇到使最大值最小、最小值最大第一反应就要是二分(有很高的概率,但也不全是二分)。2、与枚举类似,再二分/枚举答案后,想想怎么样判断它是否合法,这个过程可以再次枚举/二分来实现。通常最终都是一个O(n)来判断是否合法的。3、注意二分的写法,对于我的习惯而言,l~r是闭区间的话r需要+1或者直接特判。4、注意精度。看清题目是四舍五入还是向下取整,保留几位小数,误差是多少...原创 2019-02-13 09:00:32 · 217 阅读 · 0 评论 -
POJ 2749 Building roads(二分+2-SAT)
Building roadsTime Limit:2000MS Memory Limit:65536K Total Submissions:8539 Accepted:2908 DescriptionFarmer John's farm has N barns, and there are some cows that live in eac...原创 2019-03-02 10:06:41 · 284 阅读 · 0 评论 -
2018年 ACM/ICPC亚洲区域赛 青岛赛区现场赛 E题(ZOJ 4062 二分+思维)
Plants vs. ZombiesTime Limit: 2 Seconds Memory Limit: 65536 KBBaoBao and DreamGrid are playing the game Plants vs. Zombies. In the game, DreamGrid grows plants to defend his garden against Ba...原创 2018-11-06 17:12:22 · 1405 阅读 · 0 评论 -
HDU 6000 Wash (双二分+贪心)
WashTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 64000/64000 K (Java/Others)Total Submission(s): 2613 Accepted Submission(s): 700 Problem DescriptionMr.Panda is about to engage...原创 2018-10-29 21:45:17 · 587 阅读 · 0 评论 -
HDU 6274 Master of Sequence(思维+树状数组+二分)
题意:给你n,m。接下来n个数,给出a[i]。再接下来n个数,给出b[i]。m次查询,每次查询:若 id=1 则给出 x y 把a[i]的值修改为y。若 id=2 则给出 x y 把b[i]的值修改为y。若 id=3 则给出 k 求,其中思路:求S(t)>=k最小的t 显然是二分。注意S(t)这个式子。我们每次从1~n求的话,复杂度n*m会...原创 2018-10-18 21:24:17 · 314 阅读 · 0 评论 -
2018年2月28日训练日记
昨晚趁着精神好看资料到三点多,中间发现一道水题就交了一发,居然还submit failed。。。二分图最大匹配最优匹配会了之后感觉很简单,最难的地方还是建图。今天醒来又交了一遍WA,找了半天发现这道题可能有重边。。。(已经在重边这里错了若干次了)E题swap就是一个二分图最大匹配,可是我怎么都过不了样例,郁闷了我两三天,后来才发现输出任意答案都行,而且根据矩阵性质,如果行交换不能达到条件的话,列交...原创 2018-02-28 21:27:11 · 405 阅读 · 0 评论 -
Gym - 101778B Ran and the Lock Code(讨论+二分,好题)
B. Ran and the Lock Codetime limit per test3.0 smemory limit per test256 MBinputstandard inputoutputstandard outputTwo days ago, a woman called Fumiyo Edogawa knocked the door of Kogoro Mouri home and...原创 2018-05-14 17:31:19 · 636 阅读 · 0 评论 -
UVA - 1443 Garlands(二分+DP)
题意:给你n(n<=40000)个花环,用线串起来,你需要将它挂在天花板上挂m(m<=10000)个位置(如图所示)每个花环有一定的重量a[i]。也就是说你要把这n个花环分成m-1段。要满足三个条件:1、每一段都必须包含偶数个花环。2、每半段最多d个花环。3、使花环重量最重的半段重量最小。注意:最后一段的最后一个点一定要挂在第m个点上(The garland has to be att...原创 2018-06-08 11:15:37 · 475 阅读 · 0 评论 -
HDU 5323 Solve this interesting problem(DFS)
Solve this interesting problemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3297 Accepted Submission(s): 1058 Problem DescriptionHa...原创 2018-07-21 08:43:41 · 253 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第二场)G transform(二分)
题意:有n个位置,每个位置的坐标为x[i],有桶a[i]个。你现在要把若干个桶移动到同一个位置,求在移动总距离不超过T/2的情况下,最多可以将多少个木桶移动到同一个位置?(n<=5e5,T<=1e18,x[i]<=1e9,a[i]<=1e5)思路:二分。如官方题解所说,我们要使移动的总距离最小,那么最终被移动的桶在数轴上一定是一段连续的区间。如果固定了这个区间,那么最优...原创 2018-07-22 10:49:21 · 529 阅读 · 2 评论 -
Codeforces Round #499 (Div. 2)ABCDE比赛总结
只做了三道题,rank1100+,居然上了1分。。。分数太低了。。。A:给你n个字母,挑m个不连续、不相同的字母,看能不能挑出来a——z权值为1——26,能挑出来就输出挑出来的总权值。代码:#include<bits/stdc++.h>#define ll long long#define inf 0x3f3f3f3fusing namespace std;con...原创 2018-07-27 09:55:47 · 309 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第五场)A gpa(分数规划)
链接:https://www.nowcoder.com/acm/contest/143/A来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 262144K,其他语言524288KSpecial Judge, 64bit IO Format: %lld题目描述Kanade selected n courses in the university. The...原创 2018-08-02 21:14:40 · 231 阅读 · 0 评论 -
HDU 6383 p1m2(二分)
p1m2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 374 Accepted Submission(s): 126 Problem Description度度熊很喜欢数组!!我们称一个整数数组为稳定的,若且唯...原创 2018-08-12 19:49:18 · 230 阅读 · 0 评论 -
HDU 5726 GCD(RMQ+二分)
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 5303 Accepted Submission(s): 1909 Problem DescriptionGive you a sequence of N(N≤1...原创 2018-08-16 09:55:40 · 199 阅读 · 0 评论 -
2016年ACM/ICPC大连赛区 F题(思维+二分+逆元)
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5750题意:给你一个数n(n<=1e9),让你把n拆成若干个不相同的数的和,且这些数的积是所有拆分方法中最大的。输出这些数的最大积对1e9+...原创 2018-10-03 16:33:57 · 300 阅读 · 0 评论 -
2016年ACM/ICPC大连赛区 C题(JAVA高精度求sqrt(5)+威佐夫博弈)
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=5747题意:除了数据范围为10^100次方以外就是威佐夫博弈。关键还是sqrt(5)的精度。网上看到一种二分的求法。顺便整理个板子。代码:...原创 2018-10-03 19:06:20 · 262 阅读 · 0 评论 -
递推递归练习 中的P题
题意就是利用二分查找,从3000000个数中找出给定的数。先输入数,再输入要查找的次数,然后输入查找的数。思路:看题目就知道,是利用二分查找的方式快速找出给定的数。其他方法会TLE,因为只给了600ms的运行时间。注意用scanf会减少输入时间,比cin快,还有就是二分查找怎么找,判断终止条件,找不到输出负一。 #include#include#includeu原创 2017-03-29 19:00:45 · 365 阅读 · 0 评论