-----------------动态规划----------------
文章平均质量分 83
UMR小豪
这个作者很懒,什么都没留下…
展开
-
poj1836(dp) Alignment
AlignmentTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15867 Accepted: 5177DescriptionIn the army, a platoon(排) is composed(构成) by n soldiers. Dur原创 2016-08-16 19:31:19 · 275 阅读 · 0 评论 -
poj3280 Cheapest Palindrome
Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8973 Accepted: 4349DescriptionKeeping track of all the cows can be a tricky task so原创 2016-11-14 20:43:46 · 259 阅读 · 0 评论 -
poj3034 Whac-a-Mole
Whac-a-MoleTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3884 Accepted: 1136DescriptionWhile visiting a traveling fun fair you suddenly have an ur原创 2016-11-24 21:28:34 · 536 阅读 · 0 评论 -
C. Mahmoud and a Message
C. Mahmoud and a Messagetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMahmoud wrote a message s of lengt原创 2017-02-08 13:04:59 · 992 阅读 · 0 评论 -
Good Numbers UESTC - 832
If we sum up every digit of a number and the result can be exactly divided by 1010, we say this number is a good number.You are required to count the number of good numbers in the range from AA to原创 2017-01-12 22:13:14 · 372 阅读 · 0 评论 -
POJ 3186 Treats for the Cows
FJ has purchased N (1 The treats are interesting for many reasons:The treats are numbered 1..N and stored sequentially in single file in a long box that is open at both ends. On any day, FJ ca原创 2017-01-23 12:49:43 · 290 阅读 · 0 评论 -
D. Jon and Orbs(概率dp)
D. Jon and Orbstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJon Snow is on the lookout for some orbs re转载 2017-02-21 21:43:25 · 557 阅读 · 0 评论 -
D. Travel Card
D. Travel Cardtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputA new innovative ticketing systems for public transpor原创 2017-01-26 20:28:17 · 575 阅读 · 0 评论 -
Cent Savings UVALive - 6952
题目链接:https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4964思路:分隔式dpdp[i][j]表示长度到i的分隔次数为j的所能获得的最小值。这样我们从0到d枚举切割次数。对于当前的i我们有两个状态:1.在它前面使用一次原创 2017-02-22 19:18:34 · 564 阅读 · 0 评论 -
C. Divide by Three
C. Divide by Threetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA positive integer number n is written on原创 2017-03-28 18:26:21 · 815 阅读 · 0 评论 -
C. Functions again
C. Functions againtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputSomething happened in Uzhlyandia again...原创 2017-03-30 18:35:45 · 936 阅读 · 0 评论 -
HDU 5236 Article
ArticleTime Limit: 20 Sec Memory Limit: 256 MB题目连接http://acm.hdu.edu.cn/showproblem.php?pid=5236DescriptionAs the term is going to end, DRD begins to write his final a转载 2017-04-29 17:31:25 · 315 阅读 · 0 评论 -
Problem Arrangement ZOJ - 3777
The 11th Zhejiang Provincial Collegiate Programming Contest is coming! As a problem setter, Edward is going to arrange the order of the problems. As we know, the arrangement will have a great effect o原创 2017-01-16 12:13:24 · 367 阅读 · 0 评论 -
poj1925 Spiderman
SpidermanTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7015 Accepted: 1404DescriptionDr. Octopus kidnapped Spiderman's girlfriend M.J. and kept her原创 2016-11-16 21:02:54 · 385 阅读 · 0 评论 -
poj2948 Martian Mining
Martian MiningTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 2591 Accepted: 1608DescriptionThe NASA Space Center, Houston, is less than 200 miles fro原创 2016-11-16 17:18:40 · 387 阅读 · 0 评论 -
poj1191 棋盘分割
棋盘分割Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14504 Accepted: 5191Description将一个8*8的棋盘进行如下分割:将原棋盘割下一块矩形棋盘并使剩下部分也是矩形,再将剩下的部分继续如此分割,这样割了(n-1)次后,连同原创 2016-11-05 21:06:27 · 306 阅读 · 0 评论 -
poj1276(dp) Cash Machine
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 32571 Accepted: 11789DescriptionA Bank plans to install(安装) a machine for cash withdrawal(原创 2016-08-16 17:31:23 · 250 阅读 · 0 评论 -
poj1837 Balance
BalanceTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 13341 Accepted: 8352DescriptionGigel has a strange "balance" and he wants to poise it. Actually原创 2016-08-15 18:53:49 · 207 阅读 · 0 评论 -
poj2151 Check the difficulty of problems
Check the difficulty of problemsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6685 Accepted: 2907DescriptionOrganizing a programming contest is not原创 2016-08-05 13:53:26 · 243 阅读 · 0 评论 -
poj3267 The Cow Lexicon
The Cow LexiconTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9714 Accepted: 4650DescriptionFew know that the cows have their own dictionary with W (原创 2016-08-02 18:56:25 · 287 阅读 · 0 评论 -
Longest Ordered Subsequence
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 46261 Accepted: 20528DescriptionA numeric sequence of ai is ordered if a1 a原创 2016-07-28 08:57:38 · 238 阅读 · 0 评论 -
Cow Bowling
I - Cow BowlingTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 3176DescriptionThe cows don't use actual bowling balls whe原创 2016-07-27 15:30:30 · 333 阅读 · 0 评论 -
poj1260 Pearls
PearlsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8699 Accepted: 4351DescriptionIn Pearlania everybody is fond of pearls. One company, called The原创 2016-08-18 20:03:39 · 225 阅读 · 0 评论 -
poj1159 Palindrome
PalindromeTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 60328 Accepted: 21010DescriptionA palindrome is a symmetrical string, that is, a string read原创 2016-08-18 21:57:40 · 204 阅读 · 0 评论 -
poj1080 Human Gene Functions
Human Gene FunctionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 18886 Accepted: 10518DescriptionIt is well known that a human gene can be consider原创 2016-08-19 11:22:30 · 308 阅读 · 0 评论 -
Chinese Segment
Chinese SegmentTime Limit: 1000MS Memory Limit: 65536KBSubmit Statistic DiscussProblem DescriptionFew weeks ago, ZJS was busy with his Graduation Design (GD), after weeks of efforts he原创 2016-09-09 16:04:33 · 400 阅读 · 0 评论 -
Almost Arithmetical Progression
C - Almost Arithmetical ProgressionTime Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmit Status Practice CodeForces 255CDescriptionGena loves sequence原创 2016-09-27 21:45:15 · 475 阅读 · 0 评论 -
顺序表应用8:最大子段和之动态规划法
顺序表应用8:最大子段和之动态规划法Time Limit: 5MS Memory Limit: 500KBSubmit StatisticProblem Description 给定n(1负数时定义子段和为0,依此定义,所求的最优值为: Max{0,a[i]+a[i+1]+…+a[j]},1 注意:本题目要求用动态规划法求解,只需要输出最大子段和的值。原创 2016-09-21 21:34:13 · 1430 阅读 · 0 评论 -
C. Vladik and Memorable Trip
C. Vladik and Memorable Triptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVladik often travels by trains原创 2017-05-28 15:27:56 · 1017 阅读 · 0 评论