动态规划
Lost_in_wine
QDU创新实验室
展开
-
hdoj 5230 ZCC loves hacking
Problem DescriptionNow, a Codefires round is coming to end. ZCC has got C(0≤C≤106) points by solving all problems. He is amazed that all other contestants in his room have also solved the hardes原创 2015-05-17 21:13:58 · 573 阅读 · 0 评论 -
HDOJ 1028 Ignatius and the Princess III(整数划分)
Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16512 Accepted Submission(s): 11636Problem Descripti原创 2015-12-22 15:52:49 · 477 阅读 · 0 评论 -
动态规划 LIS最长上升子序列
Language:DefaultLongest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 41599 Accepted: 18312DescriptionA numeric sequence of a原创 2015-12-22 14:21:15 · 558 阅读 · 0 评论 -
1045. Favorite Color Stripe (30) 简单动态规划(LCS的变形)
1045. Favorite Color Stripe (30)时间限制200 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueEva is trying to make her own color原创 2015-12-02 19:44:19 · 397 阅读 · 0 评论 -
HDOJ 5569matrix (简单动态规划)
matrixTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 410 Accepted Submission(s): 245Problem DescriptionGiven a matrix with n原创 2015-11-25 09:56:29 · 616 阅读 · 0 评论 -
HDOJ 5501The Highest Mark(贪心+动态规划)
The Highest MarkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 701 Accepted Submission(s): 290Problem DescriptionThe SDOI原创 2015-10-29 14:39:13 · 661 阅读 · 0 评论 -
2015南阳理工CCPC The Battle of Chibi
The Battle of ChibiTime Limit: 6000/4000MS (Java/Others) Memory Limit: 65535/65535KB (Java/Others)Submit StatusCao Cao made up a big army and was going to invade the whole So原创 2015-10-27 00:49:47 · 1044 阅读 · 0 评论 -
HDOJ 4815 Little Tiger vs. Deep Monkey(概率DP)
Little Tiger vs. Deep MonkeyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1670 Accepted Submission(s): 598Problem Description原创 2015-10-10 13:51:33 · 596 阅读 · 0 评论 -
矩阵链乘法
/*MATRIX-CHAIN-*/#include #define N 110#define INF 0x3f3f3f3fint main() { int t, n, i, j, k, l, q; int m[N][N], p[N]; scanf("%d", &t); while (t--) { scanf("%d", &n);原创 2014-11-07 18:37:40 · 533 阅读 · 0 评论 -
1007. Maximum Subsequence Sum (25)
1007. Maximum Subsequence Sum (25)时间限制400 ms内存限制65536 kB代码长度限制16000 B判题程序Standard作者CHEN, YueGiven a sequence of K integers { N原创 2015-10-08 12:38:17 · 355 阅读 · 0 评论 -
HDOJ 5375 Gray code
Gray codeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 440 Accepted Submission(s): 254Problem DescriptionThe reflected bina原创 2015-08-12 11:13:52 · 327 阅读 · 0 评论 -
HDOJ GeoDefense
Problem DescriptionTower defense is a kind of real-time strategy computer games. The goal of tower defense games is to try to stop enemies from reaching your bases by building towers which shoot a原创 2015-05-28 15:35:00 · 467 阅读 · 0 评论 -
hdoj 1561 The more, The Better
Problem DescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因,有些城堡不能直接攻克,要攻克这些城堡必须先攻克其他某一个特定的城堡。你能帮ACboy算出要获得尽量多的宝物应该攻克哪M个城堡吗? Input每个测试实例首先包括2个原创 2015-05-27 21:43:05 · 383 阅读 · 0 评论 -
HDOJ 4722Good Numbers 数位DP
Good NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3861 Accepted Submission(s): 1229Problem DescriptionIf we sum up原创 2016-04-13 10:49:57 · 417 阅读 · 0 评论