二分判断
文章平均质量分 80
RJ28
小学生
展开
-
Hdu-5289 Assignment (二分+RMQ || 单调队列)
Problem DescriptionTom owns a company and he is the boss. There are n staffs which are numbered from 1 to n in this company, and every staff has a ability. Now, Tom is going to assign a special task原创 2016-05-29 10:51:49 · 368 阅读 · 0 评论 -
Hdu-5726 GCD (二分 + RMQ)
Problem DescriptionGive you a sequence of N(N≤100,000) integers : a1,...,an(0ai≤1000,000,000). There are Q(Q≤100,000) queries. For each query l,r you have to calculate gcd(al,,al+1,...,ar)原创 2016-07-20 21:33:48 · 656 阅读 · 0 评论 -
Ural 2038 Minimum Vertex Cover(二分图最小顶点覆盖+快速读入)
题意:给你一个二分图,让你把二分图中的点划分为三个集合:一定在最小顶点覆盖集中,一定不在,可能在。分析:若一个匹配点和一个未匹配点之间有边,那这个匹配点一定在最小顶点覆盖集中,它的另一个匹配点一定不再其中,一个一定不再其中的点连向的所有点都一定给在最小顶点覆盖集中,我们可以就这样DFS一遍求出所有结果。#include#include#include#include#inc原创 2016-08-07 20:14:57 · 760 阅读 · 2 评论 -
Gym 100886J Sockets(二分+贪心)
Valera has only one electrical socket in his flat. He also has m devices which require electricity to work. He's got n plug multipliers to plug the devices, the i-th plug multiplier has ai socke原创 2016-08-29 21:18:58 · 556 阅读 · 0 评论 -
Hdu-5884 Sort(k叉哈夫曼树)
Problem DescriptionRecently, Bob has just learnt a naive sorting algorithm: merge sort. Now, Bob receives a task from Alice.Alice will give Bob N sorted sequences, and the i-th sequence includ原创 2016-09-20 15:34:40 · 409 阅读 · 0 评论 -
Codeforces Round #390 (Div. 2) D. Fedor and coupons
All our characters have hobbies. The same is true for Fedor. He enjoys shopping in the neighboring supermarket.The goods in the supermarket have unique integer ids. Also, for every integer there i原创 2017-01-07 08:35:14 · 509 阅读 · 0 评论 -
Codeforces Round #215 (Div. 1) C. Sereja and the Arrangement of Numbers(欧拉图)
Let's call an array consisting of n integer numbers a1, a2, ..., an, beautiful if it has the following property:consider all pairs of numbers x, y (x ≠ y), such that number x occurs in the a原创 2017-02-09 20:28:02 · 375 阅读 · 0 评论 -
Codeforces Round #397 F. Souvenirs(线段树,离线)
Artsem is on vacation and wants to buy souvenirs for his two teammates. There are n souvenir shops along the street. In i-th shop Artsem can buy one souvenir for ai dollars, and he cannot buy more原创 2017-02-23 15:58:05 · 413 阅读 · 0 评论 -
CCNU校赛2017 - C 奇数串
Description给出一个仅包含小写字母的字符串,求其所有子串,满足子串中的所有字母出现奇数次。Input首先输入一个整数 TTT,表示TTT 组数据。接下来 TTT 行,每行表示一个非空字符串。 约定:TTT 不超过 20; 字符串长度不超过100000; 至多只有十组数据的字符串长度超过10000。 Output对每组用例,输出 CASE #i:原创 2017-05-10 20:01:36 · 541 阅读 · 0 评论 -
Hdu-5371 Hotaru's problem(马拉车算法)
Problem DescriptionHotaru Ichijou recently is addicated to math problems. Now she is playing with N-sequence.Let's define N-sequence, which is composed with three parts and satisfied with the foll原创 2017-07-20 09:22:33 · 279 阅读 · 0 评论 -
Educational Codeforces Round 27 E. Fire in the City(二维离散化)
The capital of Berland looks like a rectangle of size n × m of the square blocks of same size.Fire!It is known that k + 1 blocks got caught on fire (k + 1 ≤ n·m). Those blocks are centers of ignit原创 2017-09-16 10:18:55 · 370 阅读 · 0 评论 -
LA 4726 Average(单调队列)
题意:求连续的子序列使得平均数最大。分析:按照《浅谈数形结合思想在信息学竞赛中的应用》中的做法,维护一个下凸的决策区间,但是注意原作者提到单调栈做法并不是指决策是随着右端点单调的,而是指最优解是随着左端点单调的。#include#include#include#include#include#include#include#include#i原创 2016-08-03 21:06:17 · 300 阅读 · 0 评论 -
Uva 11107 Life Forms(后缀数组 + 二分)
题意:给你n个DNA序列,求一个最长的字符串,使得它在超过一半的DNA序列中出现,若多解按字典序从小到大输出所有解。分析:白书例题,把n个字符串连接到一块后求它的后缀数组,然后我们可以来二分答案然后遍历一遍后缀数组来验证。#include#include#include#include#include#include#include#include#incl原创 2016-07-29 23:42:17 · 374 阅读 · 0 评论 -
8VC Venture Cup 2016 - Elimination Round C. Block Towers
Students in a class are making towers of blocks. Each student makes a (non-zero) tower by stacking pieces lengthwise on top of each other.n of the students use pieces made of two blocks andm of th原创 2016-05-22 22:28:29 · 452 阅读 · 0 评论 -
Codeforces Round #352 (Div. 1) B. Robin Hood
We all know the impressive story of Robin Hood. Robin Hood uses his archery skills and his wits to steal the money from rich, and return it to the poor.There are n citizens in Kekoland, each person原创 2016-05-12 23:29:35 · 568 阅读 · 0 评论 -
LA 4253 Archery (二分)
Korea's reputation in archery is well known because the Korean archery teams have been sweeping almost all gold, silver, and bronze medals in the Olympic Games.An archery game ICPC supported by NE原创 2016-05-05 08:23:49 · 1255 阅读 · 0 评论 -
UVa 11627 Slalom (二分)
You are competing in a ski slalom, and you need to selectthe best skis for the race. The format of the race is that there areNpairs of left and right gates, where each right gate isW metres to the rig原创 2016-04-26 17:33:21 · 535 阅读 · 0 评论 -
LA 4254 Processor (单调队列 + 二分)
题意:有n个任务,每个任务有三个参数,ri,di,wi,表示在ri di之内需要执行完工作量为wi的任务,任务可以分块执行,求执行过程中的最大速度的最小值。速度需为整数。分析:二分判断,判断有些复杂,要用到单调队列,写的挺烂的,但是一遍过了。#include #include #include #include #include #define MAXN 10002原创 2016-04-25 21:21:35 · 938 阅读 · 0 评论 -
POJ-2949 Word Rings(SPFA DFS实现 + 环上平均权值最大)
DescriptionA word ring is a sequence of words where the last two letters of each word are the same as the first two letters of the next word (and the last two letters of the last word are the same a原创 2016-06-20 09:44:53 · 1366 阅读 · 0 评论 -
LA 3211 Now or later(2-SAT)
题意:有n架飞机,每架飞机有早着陆和晚着陆两种选择,而且必须选择一种,第i架飞机的早晚着陆时间分别为Ei Li,问你相邻两架飞机的着陆间隔的最小值的最大值是多少。分析:每个飞机有早晚着陆两种选择,若i早着陆则xi为1否则为0,适用于2-SAT模型,我们可以二分时间间隔然后判断能不能有合法的赋值方案。#include #include #include #inc原创 2016-07-27 14:30:53 · 364 阅读 · 0 评论 -
UVa 11090 Going in Cycle!!(环上平均值最大+SPFA DFS判负环)
题意:给定一个n个点m条边的加权有向图,求平均权值最小的回路。分析:二分+负权回路的判断,数据居然有自环,MDZZ,WA了一晚上。#include #include #include #include #include #include #include #include #include #defi原创 2016-07-27 23:54:49 · 521 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) D. Friends and Subsequences (二分+RMQ)
Mike and !Mike are old childhood rivals, they are opposite in everything they do, except programming. Today they have a problem they cannot solve on their own, but together (with you) — who knows?原创 2016-07-18 22:27:51 · 573 阅读 · 0 评论 -
Codeforces Round #361 (Div. 2) C. Mike and Chocolate Thieves(二分判断)
Bad news came to Mike's village, some thieves stole a bunch of chocolates from the local factory! Horrible!Aside from loving sweet things, thieves from this area are known to be very greedy. So af原创 2016-07-18 22:44:20 · 283 阅读 · 0 评论 -
Codeforces Round #441 (Div. 1, by Moscow Team Olympiad) D. High Cry
Disclaimer: there are lots of untranslateable puns in the Russian version of the statement, so there is one more reason for you to learn Russian :)Rick and Morty like to go to the ridge High Cry for原创 2017-10-26 19:10:49 · 284 阅读 · 0 评论