随笔分类 -  算法:动态规划

摘要:LabyrinthTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1507Accepted Submission(s): 520Problem De... 阅读全文
posted @ 2014-05-17 12:17 Freecode# 阅读(573) 评论(0) 推荐(0) 编辑
摘要:ClockwiseTime Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描述Saya have a long necklace with N beads, and she signs the beads from 1 to N. Then she fi... 阅读全文
posted @ 2014-04-14 17:34 Freecode# 阅读(780) 评论(0) 推荐(0) 编辑
摘要:WarcraftTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 957Accepted Submission(s): 487Problem DescriptionHave you ever played the Warcraft?It doesn't matter whether you have played it !We will give you such an experience.There are so many Heroe 阅读全文
posted @ 2014-01-26 12:46 Freecode# 阅读(681) 评论(0) 推荐(0) 编辑
摘要:Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13646Accepted Submission(s): 3879Problem DescriptionJGShining's kingdom consists of 2n(n is no more than 500,000) small cities which are located in two 阅读全文
posted @ 2014-01-25 20:28 Freecode# 阅读(297) 评论(0) 推荐(0) 编辑
摘要:Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14584Accepted Submission(s): 6313Problem DescriptionA 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 阅读全文
posted @ 2014-01-24 22:26 Freecode# 阅读(626) 评论(0) 推荐(0) 编辑
摘要:Advanced FruitsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1360Accepted Submission(s): 672Special JudgeProblem DescriptionThe company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one 阅读全文
posted @ 2014-01-24 22:22 Freecode# 阅读(1111) 评论(0) 推荐(0) 编辑
摘要:搬寝室Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14107Accepted Submission(s): 4751Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n 阅读全文
posted @ 2014-01-22 20:37 Freecode# 阅读(1503) 评论(0) 推荐(0) 编辑
摘要:龟兔赛跑Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1Accepted Submission(s) : 1Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description据说在很久很久以前,可怜的兔子经历了人生中最大的打击——赛跑输给乌龟后,心中郁闷,发誓要报仇雪恨,于是躲进了杭州下沙某农业园卧薪尝胆潜心修炼,终于练成了绝技,能够毫不休息得以恒定的速度(VR m/s)一直跑 阅读全文
posted @ 2014-01-21 22:11 Freecode# 阅读(408) 评论(0) 推荐(0) 编辑
摘要:最少拦截系统Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11667Accepted Submission(s): 4585Problem Description某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉到敌国的导弹来袭.由于该系统还在试用阶段,所以只有一套系统,因此有可能不能拦截所有的导弹.怎么办呢?多搞几 阅读全文
posted @ 2014-01-20 16:21 Freecode# 阅读(1348) 评论(1) 推荐(1) 编辑
摘要:Common SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18765Accepted Submission(s): 7946Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another. 阅读全文
posted @ 2013-11-14 21:38 Freecode# 阅读(415) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示