- 博客(14)
- 收藏
- 关注
RSS订阅原创 hdu 4261 Estimation （优先队列预处理+DP）
EstimationTime Limit: 40000/15000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 598 Accepted Submission(s): 206Problem Description“There are to
2014-03-27 22:18:28
1528
原创 hdu 4610 Cards （贪心+暴力）
CardsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1214 Accepted Submission(s): 265Problem DescriptionGiven some cards ea
2014-03-19 21:40:44
1079
原创 poj 1037 A decorative fence （ dp+输出第k字典序）
A decorative fenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6357 Accepted: 2313DescriptionRichard just finished building his new house. Now the on
2014-03-18 20:56:43
1311
原创 hdu 4389 X mod f(x) （数位DP）
X mod f(x)Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1568 Accepted Submission(s): 660Problem DescriptionHere is a func
2014-03-15 21:15:35
935
原创 hdu 4734 F(x) （数位dp）
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1140 Accepted Submission(s): 459Problem DescriptionFor a decimal number x
2014-03-15 20:18:19
933
原创 hdu 4003 Find Metal Mineral （树形dp）
Find Metal MineralTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 2122 Accepted Submission(s): 965Problem DescriptionHumans
2014-03-15 17:03:21
982
原创 zoj 3422 Go Deeper （ 二分+2-sat ）
Go DeeperTime Limit: 2 Seconds Memory Limit: 65536 KB Here is a procedure's pseudocode: go(int dep, int n, int m) begin output the value of dep. if dep m an
2014-03-12 21:56:57
1103
原创 周赛 1007 题解 hdu 4390 Number Sequence （质因数分解+组合数学+容斥原理）
Number SequenceTime Limit: 10000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 790 Accepted Submission(s): 331Problem DescriptionGiven a n
2014-03-10 21:05:09
1878
1
原创 周赛 1009 题解 hdu 2717 Catch That Cow （简单bfs）
Catch That CowTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6016 Accepted Submission(s): 1914Problem DescriptionFarmer Jo
2014-03-10 19:09:47
1033
原创 周赛1003题解 hdu 1598 find the most comfortable road （二分+bfs 或者 并查集）
find the most comfortable roadTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3145 Accepted Submission(s): 1334Problem Descript
2014-03-10 15:48:21
1137
原创 poj 1417 True Liars （并查集+dp）
True LiarsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 1776 Accepted: 535DescriptionAfter having drifted about in a small boat for a couple of days,
2014-03-08 21:21:17
1463
原创 uva 709 &poj 1093 - Formatting Text （dp之小白告一段落）
709 - Formatting TextWritings e-mails is fun, but, unfortunately, they do not look very nice, mainly because not all lines have the same lengths. In this problem, your task is to write an e-mail
2014-03-06 21:15:26
1506
原创 Codeforces Round #234 (Div. 2) D. Dima and Bacteria
D. Dima and Bacteriatime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima took up the biology of bacteria,
2014-03-06 15:25:52
1163
原创 uva 10558 - A Brief Gerrymander （dp之不好理解的题意）
链接：uva 10558题意：一个棋盘，横竖线都是从1到100标号（竖线从左到右标，横线从下到上标），输入n表示有n个被标记的格子，给出这个格子的左下角坐标，然后输入m，在输入m个数，表示在这些竖线的地方切开棋盘（其实只切了m-2刀，因为2刀必须是1和100，相当于没有），然后输入A，表示你要在横上上切A刀（其实也只是A-2刀，因为2刀必须在横线的1和100）。那么就可以把棋盘很多个大小不一的
2014-03-05 16:48:32
1240
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人