DP
pupil_blue
这个作者很懒,什么都没留下…
展开
-
Zzuli OJ-----1894简单DP
Time Limit: 1 Sec Memory Limit:128 MBSubmit: 359 Solved: 74SubmitStatusWeb BoardDescription985走入了一个n * n的方格地图,他已经知道其中有一个格子是坏的。现在他要从(1, 1)走到(n, n),每次只可以向下或者向右走一步,问他能否到达(n,n)。若不能到达输出-1原创 2016-08-06 11:40:51 · 224 阅读 · 0 评论 -
NYOJ-----16---矩阵嵌套DP
矩形嵌套时间限制:3000 ms | 内存限制:65535 KB难度:4描述 有n个矩形,每个矩形可以用a,b来描述,表示长和宽。矩形X(a,b)可以嵌套在矩形Y(c,d)中当且仅当a<c,b<d或者b<c,a<d(相当于旋转X90度)。例如(1,5)可以嵌套在(6,2)内,但不能嵌套在(3,4)中。你的任务是选出尽可能多的矩形排成一行,使得除最后一个外,每一个矩形都可以嵌套在原创 2016-12-24 04:02:54 · 376 阅读 · 0 评论 -
POJ-----1088---滑雪DP
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 93921 Accepted: 35555DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等原创 2016-12-23 22:17:06 · 247 阅读 · 0 评论 -
HDOJ-----1058---Humble Numbers(DP)
A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers.原创 2016-11-13 01:46:06 · 288 阅读 · 0 评论 -
Light OJ-----1097 01背包dp
1079 - Just another Robbery PDF (English)StatisticsForumTime Limit: 4 second(s)Memory Limit: 32 MBAs Harry Potter series is over, Harry has原创 2016-10-01 15:35:57 · 262 阅读 · 0 评论 -
HDOJ-----2602Bone Collector(DP-----01背包)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 51860 Accepted Submission(s): 21837Problem DescriptionMany years ag原创 2016-08-15 11:36:37 · 234 阅读 · 0 评论 -
HDOJ-----1087Super Jumping! Jumping! Jumping!(DP)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 33937 Accepted Submission(s): 15374Problem Descript原创 2016-08-12 21:35:55 · 207 阅读 · 0 评论 -
Zzuli OJ-----1904 小火山的股票交易
1904: 小火山的股票交易Time Limit: 1 Sec Memory Limit: 128 MBSubmit: 59 Solved: 20SubmitStatusWeb BoardDescription “股市有风险,入市需谨慎”,小火山经历了之前买卖一次或者两次的股票♂交易,对于股票买卖已经很有经验了,现在的他最多可以进行K次买卖,身为一个聪原创 2016-08-11 17:43:28 · 1003 阅读 · 0 评论 -
HDOJ-----1069Monkey and Banana
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12738 Accepted Submission(s): 6675Problem DescriptionA group of原创 2016-08-09 17:20:42 · 360 阅读 · 0 评论 -
HDOJ-----1559最大子矩阵
最大子矩阵Time Limit: 30000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4147 Accepted Submission(s): 2162Problem Description给你一个m×n的整数矩阵,在上面找一个x×y原创 2016-08-09 15:41:13 · 185 阅读 · 0 评论 -
POJ-----1745Divisibility
DivisibilityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11525 Accepted: 4132DescriptionConsider an arbitrary sequence of integers. One can place +原创 2016-08-09 11:46:20 · 183 阅读 · 0 评论 -
HDOJ-----1176免费馅饼
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 41775 Accepted Submission(s): 14340Problem Description都说天上不会掉馅饼,但有一天gameboy正走原创 2016-08-09 09:14:35 · 171 阅读 · 0 评论 -
HDOJ-----1260Tickets
TicketsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3192 Accepted Submission(s): 1576Problem DescriptionJesus, what a great mo原创 2016-08-08 17:23:43 · 151 阅读 · 0 评论 -
HDOJ-----1231最大连续子序列
最大连续子序列Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28057 Accepted Submission(s): 12697Problem Description给定K个整数的序列{ N1, N2, .原创 2016-08-08 15:46:00 · 301 阅读 · 0 评论 -
HDOJ-----1003Max Sum
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 217002 Accepted Submission(s): 51163Problem DescriptionGiven a sequence a[原创 2016-08-08 16:01:27 · 279 阅读 · 0 评论 -
Open Judge-----4118简单DP
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice OpenJ_Bailian 4118 Description北大信息学院的同学小明毕业之后打算创业开餐馆.现在共有n 个地点可供选择。小明打算从中选择合适的位置开设原创 2016-08-06 11:22:37 · 257 阅读 · 0 评论 -
P OJ-----3176DP动态规划入门
Cow BowlingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17407 Accepted: 11611DescriptionThe cows don't use actual bowling balls when they go bowlin原创 2016-07-30 10:46:54 · 232 阅读 · 0 评论 -
动态规划基础-----HDOJ2059----龟兔赛跑
Problem Description据说在很久很久以前,可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后,心中郁闷,发誓要报仇雪恨,于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼,终于练成了绝技,能够毫不休息得以恒定的速度(VR m/s)一直跑。兔子一直想找机会好好得教训一下乌龟,以雪前耻。最近正值HDU举办50周年校庆,社会各大名流齐聚下沙,兔子也趁此机会向乌龟发起挑战。虽然乌龟深知获胜原创 2016-01-07 22:00:58 · 391 阅读 · 0 评论 -
HDOJ-----1466---计算直线的交点数---动态规划
计算直线的交点数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9789 Accepted Submission(s): 4461Problem Description平面上有n条直线,且无三线共点,问这些直线原创 2017-03-12 11:48:10 · 323 阅读 · 0 评论