dp
关注
分享
扫一扫
文章平均质量分 84
utobe67
这个作者很懒，什么都没留下…
展开
-
hdu 3630 Crystal mine
Crystal mineTime Limit: 5000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 528 Accepted Submission(s): 86Problem DescriptionLegends always原创 2013-07-04 07:34:08 · 1125 阅读 · 2 评论 -
poj 2923 Relocation
RelocationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1479 Accepted: 597DescriptionEmma and Eric are moving to their new house they bought after ret原创 2013-07-03 00:13:35 · 962 阅读 · 0 评论 -
Codeforces Round #193 (Div. 2) B. Maximum Absurdity （DP、RMQ两种解法）
B. Maximum Absurditytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputReforms continue entering Berland. For原创 2013-07-25 14:56:21 · 1268 阅读 · 0 评论 -
poj 2288 Islands and Bridges (用DP解汉密尔顿问题)
Islands and BridgesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 7970 Accepted: 2055DescriptionGiven a map of islands and bridges that connect these i原创 2013-08-19 15:36:00 · 1169 阅读 · 0 评论 -
hdu 4487 Maximum Random Walk (概率dp)
Maximum Random WalkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 219 Accepted Submission(s): 120Problem DescriptionConsider原创 2013-08-12 19:36:10 · 1544 阅读 · 0 评论 -
hdu 4489 The King’s Ups and Downs (DP+组合)
The King’s Ups and DownsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 172 Accepted Submission(s): 106Problem DescriptionThe原创 2013-08-12 19:53:07 · 1739 阅读 · 0 评论 -
zoj 2027 Travelling Fee ( 两种解法 1.SPFA 2.floyd()+dp )
Travelling FeeTime Limit: 2 Seconds Memory Limit: 65536 KB Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next原创 2013-08-13 15:32:31 · 1222 阅读 · 0 评论 -
hdu 1024 Max Sum Plus Plus (dp+二维变一维)
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13722 Accepted Submission(s): 4522Problem DescriptionNow I t原创 2013-09-06 21:03:58 · 1307 阅读 · 0 评论 -
hdu 1069 Monkey and Banana (两种解法 1.dp 2.记忆化搜索)
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6069 Accepted Submission(s): 3085Problem DescriptionA grou原创 2013-09-07 12:37:08 · 2246 阅读 · 0 评论 -
hdu 3466 Proud Merchants （01背包变形）
Proud MerchantsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1672 Accepted Submission(s): 671Problem DescriptionRecently,原创 2013-06-15 22:35:59 · 931 阅读 · 0 评论 -
Codeforces Round #198 (Div. 2) C. Tourist Problem （数学+dp）
C. Tourist Problemtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub is a big fan of tourists. He wants原创 2013-08-31 21:37:46 · 1486 阅读 · 0 评论 -
hdu 1074 Doing Homework (状压dp)
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4149 Accepted Submission(s): 1668Problem DescriptionIgnatius原创 2013-09-10 23:28:37 · 1248 阅读 · 0 评论 -
hdu 4714 Tree2cycle (树形dp)
Tree2cycleTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1005 Accepted Submission(s): 234Problem DescriptionA tree with N原创 2013-09-10 21:24:17 · 1374 阅读 · 0 评论 -
hdu 1003 Max Sum
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 107975 Accepted Submission(s): 24868Problem DescriptionGiven a sequence a[原创 2013-05-31 21:06:17 · 978 阅读 · 0 评论 -
hdu 3681 Prison Break (旅行商问题)
Prison BreakTime Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2436 Accepted Submission(s): 612Problem DescriptionRompire is a r原创 2013-10-01 10:53:13 · 1662 阅读 · 4 评论 -
hdu 4568 Hunter (旅行商问题)
HunterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 692 Accepted Submission(s): 190Problem Description One day, a hunter n原创 2013-10-01 19:48:58 · 1713 阅读 · 0 评论 -
poj 3375 Network Connection (优化 dp)
Network ConnectionTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3126 Accepted: 686DescriptionThere are M network interfaces in the wall of aisle of li原创 2013-10-02 12:26:20 · 1506 阅读 · 0 评论 -
poj 3419 Difference Is Beautiful (区间最长连续不重复数 dp+二分+RMQ)
Difference Is BeautifulTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 1893 Accepted: 579DescriptionMr. Flower's business is growing much faster than or原创 2013-10-02 19:20:47 · 1910 阅读 · 0 评论 -
hdu 1987 How many ways (两种解法 1.搜索 2.dp)
How many waysTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2112 Accepted Submission(s): 1274Problem Description这是一个简单的生存游戏，原创 2013-09-19 11:04:07 · 1317 阅读 · 0 评论 -
hdu 4745 Two Rabbits （最长非连续回文子序列）
Two RabbitsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 681 Accepted Submission(s): 352Problem DescriptionLong long ago,原创 2013-10-04 20:52:58 · 1070 阅读 · 0 评论 -
hdu 4756 Install Air Conditioning (MST+树形dp)
Install Air ConditioningTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 656 Accepted Submission(s): 134Problem Description原创 2013-10-06 09:12:46 · 1471 阅读 · 0 评论 -
hdu 4455 Substrings （经典DP）
SubstringsTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1177 Accepted Submission(s): 356Problem DescriptionXXX has an ar原创 2013-10-11 22:25:22 · 1727 阅读 · 0 评论 -
Codeforces Round #198 (Div. 2) D. Bubble Sort Graph （转化为最长非降子序列）
D. Bubble Sort Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIahub recently has learned Bubble Sort,原创 2013-08-31 21:15:50 · 2005 阅读 · 0 评论 -
hdu 4126 Genghis Khan the Conqueror (MST+树形dp)
Genghis Khan the ConquerorTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 1208 Accepted Submission(s): 332Problem Descript原创 2013-09-27 16:57:49 · 1864 阅读 · 0 评论 -
poj 3635 Full Tank? ( bfs+dp思想 )
Full Tank?Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5857 Accepted: 1920Description After going through the receipts from your car trip through Eur原创 2013-10-12 21:38:27 · 1584 阅读 · 0 评论 -
hdu 4405 Aeroplane chess （概率dp）
Aeroplane chessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 952 Accepted Submission(s): 652Problem DescriptionHzz loves原创 2013-10-23 23:01:42 · 1033 阅读 · 0 评论 -
wustoj 1269: 划分数 (搜索、dp两种解法)
1269: 划分数Time Limit: 1 Sec Memory Limit: 128 MB[Submit][Status][Web Board]Problem Description将整数n分成m份,求划分的种数，注意每份不为空，不考虑顺序。比如整数4的划分，1 1 2 和 1 2 1 以及2 1 1 为同一种划分。Input多组测试样原创 2013-11-16 20:53:07 · 1898 阅读 · 0 评论 -
hdu 4778 Gems Fight! ( 状压dp+记忆化搜索 )
Gems Fight!Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 327680/327680 K (Java/Others)Total Submission(s): 511 Accepted Submission(s): 211Problem Description Alice an原创 2013-11-16 23:42:32 · 1969 阅读 · 0 评论 -
hdu 4681 String （dp预处理+枚举）
StringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1250 Accepted Submission(s): 455Problem DescriptionGiven 3 strings A, B原创 2013-11-30 21:50:31 · 922 阅读 · 0 评论 -
Codeforces Round #216 (Div. 2) C. Valera and Elections (树形dp)
C. Valera and Electionstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe city Valera lives in is going to原创 2013-11-30 11:07:43 · 1562 阅读 · 0 评论 -
Codeforces Round #214 (Div. 2) C. Dima and Salad （背包变形）
C. Dima and Saladtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDima, Inna and Seryozha have gathered in a原创 2013-12-10 22:16:52 · 1712 阅读 · 3 评论 -
hdu 4679 Terrorist’s destroy ( 树形dp 树的直径 )
Terrorist’s destroyTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1212 Accepted Submission(s): 358Problem DescriptionThere i原创 2013-12-05 23:51:46 · 1161 阅读 · 0 评论 -
Codeforces Round #221 (Div. 2) B. I.O.U. C. Divisible by Seven D. Maximum Submatrix 2 解题报告
B. I.O.U.题目链接：点击打开链接思路：将每个人得多少、欠多少综合起来看，一个关系内的debts最小就是得的总和或者欠的总和.ps：这题数据貌似很水，很多代码都水过了...代码：#include #include #include #include #include #include #include #include #inc原创 2013-12-25 10:49:29 · 1708 阅读 · 2 评论 -
小白dp 348 Optimal Array Multiplication Sequence
Optimal Array Multiplication SequenceGiven two arrays A and B, we can determine the array C = A B using the standard definition of matrix multiplication:The number of columns in the A arra原创 2013-12-30 09:52:08 · 1134 阅读 · 0 评论 -
hdu 4804 Campus Design （状压dp）
Campus DesignTime Limit: 15000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 193 Accepted Submission(s): 98Problem DescriptionNanjing Univ原创 2014-01-07 19:00:23 · 1532 阅读 · 0 评论 -
小白dp uva 10271 - Chopsticks
Problem CChopsticksInput: Standard InputOutput: Standard OutputIn China, people use a pair of chopsticks to get food on the table, but Mr. L is a bit different. He uses a set of three chop原创 2014-01-12 14:39:14 · 1185 阅读 · 0 评论 -
小白dp uva 10304 - Optimal Binary Search Tree
10304 - Optimal Binary Search TreeProblem EOptimal Binary Search TreeInput: standard inputOutput: standard outputTime Limit: 30 secondsMemory Limit: 32 MBGiven a set S = (e1, e2, ...,原创 2014-01-12 14:50:19 · 1239 阅读 · 1 评论 -
zoj 3149 Breadtree
D -BreadtreeCrawling in process...Crawling failedTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatus DescriptionBreadtree is a kind of t原创 2014-01-21 22:00:50 · 1299 阅读 · 0 评论 -
小白dp uva 10154 - Weights and Measures （贪心+dp ）
Problem F: Weights and MeasuresI know, up on top you are seeing great sights, But down at the bottom, we, too, should have rights. We turtles can't stand it. Our shells will all crack! Besides原创 2014-01-14 21:32:03 · 1301 阅读 · 0 评论 -
poj 2795 Exploring Pyramids
Exploring PyramidsTime Limit: 6000MS Memory Limit: 65536KTotal Submissions: 1971 Accepted: 899Case Time Limit: 2000MSDescriptionArchaeologists have discover原创 2014-01-24 09:56:43 · 1312 阅读 · 0 评论