二分法
关注
分享
扫一扫
文章平均质量分 85
overload1997
努力 努力 再努力
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
2013长沙现场赛A - Alice's Print Service
题意：给你2n个数，b[i]表示不小于a[i]页数时的单价，问你印刷一定页数时，最便宜是多少钱。因为可以选择再刷多n页来改变单价从而改变总价格，所以要考虑的东西比较多。下面给代码。#include #include #include #include#include#include#include#includeusing namespace std;#define原创 2016-07-30 17:17:53 · 399 阅读 · 0 评论 -
Codeforces Round #384 (Div. 2) E. Vladik and cards
E. Vladik and cardstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVladik was bored on his way home and de原创 2017-07-21 17:32:14 · 266 阅读 · 0 评论 -
UVALive 4625 Garlands（dp+二分）
题目链接：点击打开链接由于求的是最少的【半段重量最大值】，显然二分重量上界并判断是否可行即可。初步思路是贪心，从左到右将可行的分段尽量拉长。但是这样会遇到一些情况没能够考虑到，例如以下数据：114 5 1018 11 9 96 3 11 96 67 31 12 58 68 98 76这组数据的答案是110，而从左到右的贪心得到的结果是126。于是思路转为求出在当前二分原创 2017-03-07 16:36:55 · 435 阅读 · 0 评论 -
codeforces 782B The Meeting Place Cannot Be Changed
B. The Meeting Place Cannot Be Changedtime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe main road in Byt原创 2017-03-07 14:50:58 · 197 阅读 · 0 评论 -
UVALive 3608 Period（DP+二分）
题目链接：点击打开链接首先考虑这个问题与一般编辑问题的区别，在这个问题中可以在第二个串的任意地方掐掉重新对第一个串进行dp也就是说，可以将dp[n][j]的状态转移给dp[0][j]（n为第一个串的长度）要求的答案是所有段中编辑距离最大的那段的最小值，也就是说需要记录所有从n转移到0的时候的dp[n][j]的值以用来比较取最大。显然这么做十分麻烦，所以可以考虑设一个编辑距离上界原创 2017-03-19 21:06:18 · 279 阅读 · 0 评论 -
Codeforces Round #398(Div. 2)D. Cartons of milk
D. Cartons of milktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOlya likes milk very much. She drinks k原创 2017-02-21 17:03:12 · 394 阅读 · 0 评论 -
Codeforces Round #402 (Div. 2) D. String Game
D. String Gametime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputLittle Nastya has a hobby, she likes to remo原创 2017-02-28 16:51:54 · 229 阅读 · 0 评论 -
2016 ICPC大连赛区 hdu5976 Detachment
DetachmentTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 437 Accepted Submission(s): 144Problem DescriptionIn a highly devel原创 2016-11-18 21:53:54 · 652 阅读 · 0 评论 -
HDU 3681 Prison Break
Prison BreakTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4726 Accepted Submission(s): 1288Problem DescriptionRompire is a原创 2016-10-20 23:59:43 · 262 阅读 · 0 评论 -
Codeforces732D Exams
D. Examstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy has an exam period which will continue for原创 2016-10-25 13:54:35 · 480 阅读 · 0 评论 -
hdu 5884 Sort
SortTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 739 Accepted Submission(s): 144Problem DescriptionRecently, Bob has just原创 2016-09-17 21:34:29 · 312 阅读 · 0 评论 -
hdu 3586 Information Disturbing
Information DisturbingTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2667 Accepted Submission(s): 949Problem DescriptionIn原创 2016-08-20 14:56:07 · 397 阅读 · 0 评论 -
hdu 6070 Dirt Ratio
Dirt RatioTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 384 Accepted Submission(s): 120Special JudgeProblem DescriptionI原创 2017-08-03 21:25:33 · 713 阅读 · 0 评论