二分
hehedad
这个作者很懒,什么都没留下…
展开
-
Poj__3258 River Hopscotch (二分~最大化最小值)
River HopscotchTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18067 Accepted: 7544DescriptionEvery year the cows hold an event featuring a peculiar version of hopscotch that involves carefu...原创 2018-05-01 16:00:50 · 168 阅读 · 0 评论 -
2019牛客暑期多校训练营(第六场)D Move(表面二分实则暴力)
链接:https://ac.nowcoder.com/acm/contest/886/D来源:牛客网时间限制:C/C++ 2秒,其他语言4秒空间限制:C/C++ 262144K,其他语言524288K64bit IO Format: %lld题目描述After the struggle of graduating from college, TangTang is about...原创 2019-08-03 17:29:49 · 253 阅读 · 0 评论 -
HDU - 6469 故事 (二分+预处理)
故事Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 138Accepted Submission(s): 8Problem Description这是一个极其老套的故事,无论怎样的描述都会因为故事本身的古老而显得陈...原创 2019-03-18 20:12:52 · 358 阅读 · 2 评论 -
CodeForces - 1066B Heaters (水题,模拟+二分)
Vova's house is an array consisting of nn elements (yeah, this is the first problem, I think, where someone lives in the array). There are heaters in some positions of the array. The ii-th element of ...原创 2018-12-02 22:08:30 · 220 阅读 · 0 评论 -
HDU - 6383 p1m2 百度之星(二分)
度度熊很喜欢数组!! 我们称一个整数数组为稳定的,若且唯若其同时符合以下两个条件: 1. 数组里面的元素都是非负整数。 2. 数组里面最大的元素跟最小的元素的差值不超过 11。 举例而言,[1,2,1,2][1,2,1,2] 是稳定的,而 [−1,0,−1][−1,0,−1] 跟 [1,2,3][1,2,3] 都不是。 现在,定义一个在整数数组进行的操作: * 选择数组中两个不同的元素...原创 2018-08-13 09:39:18 · 160 阅读 · 0 评论 -
POJ - 2112 Optimal Milking(floyd传递闭包+二分枚举+二分图多重匹配)
Optimal MilkingTime Limit: 2000MS Memory Limit: 30000K Total Submissions: 19622 Accepted: 7022 Case T...原创 2018-08-06 23:57:37 · 140 阅读 · 0 评论 -
POJ - 3189 Steady Cow Assignment(二分+二分图多重匹配)
Steady Cow AssignmentTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 7289 Accepted: 2506 DescriptionFarmer John's N (1 <= N <= 1000) cows each reside in one of...原创 2018-08-06 20:25:51 · 314 阅读 · 0 评论 -
HDU - 3081 Marriage Match II (最大流+二分+并查集+(*你*别忘了别再建重边了))
Presumably, you all have known the question of stable marriage match. A girl will choose a boy; it is similar as the game of playing house we used to play when we are kids. What a happy time as so man...原创 2018-08-10 11:53:55 · 178 阅读 · 0 评论 -
POJ - 2289 Jamie's Contact Groups
Jamie's Contact GroupsTime Limit: 7000MS Memory Limit: 65536K Total Submissions: 8667 Accepted: 2941 DescriptionJamie is a very popular girl and has quite a lot of friends, so ...原创 2018-08-06 10:27:31 · 442 阅读 · 0 评论 -
HDU - 3605 Escape
2012 If this is the end of the world how to do? I do not know how. But now scientists have found that some stars, who can live, but some people do not fit to live some of the planet. Now scientists wa...原创 2018-08-09 20:05:42 · 126 阅读 · 0 评论 -
Walking in the Forest (二分~最小化最大值)
链接:https://www.nowcoder.com/acm/contest/106/K来源:牛客网题目描述 It’s universally acknowledged that there’re innumerable trees in the campus of HUST. Now you're going to walk through a large forest. The...原创 2018-04-29 21:26:53 · 317 阅读 · 0 评论 -
2019牛客暑期多校训练营(第九场)H Cutting Bamboos(主席树+二分)
链接:https://ac.nowcoder.com/acm/contest/889/H来源:牛客网题目描述There are n bamboos arranged in a line. The i-th bamboo from the left has height hih_{i}hi.You are given q queries of the type (l, r, x, ...原创 2019-08-15 23:58:50 · 353 阅读 · 0 评论