随笔分类 -  动归

摘要:1055 最长等差数列 基准时间限制:2 秒 空间限制:262144 KB 分值: 80 难度:5级算法题 1055 最长等差数列 基准时间限制:2 秒 空间限制:262144 KB 分值: 80 难度:5级算法题 1055 最长等差数列 基准时间限制:2 秒 空间限制:262144 KB 分值:  阅读全文
posted @ 2016-09-16 20:42 Przz 阅读(355) 评论(0) 推荐(0)
摘要:1610 路径计数 基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 路径上所有边权的最大公约数定义为一条路径的值。 给定一个有向无环图。T次修改操作,每次修改一条边的边权,每次修改后输出有向无环图上路径的值为1的路径数量(对1,000,000,007取模)。 路径 阅读全文
posted @ 2016-09-09 21:13 Przz 阅读(508) 评论(0) 推荐(0)
摘要:1270 数组的最大代价题目来源: HackerRank基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 数组A包含N个元素A1, A2......AN。数组B包含N个元素B1, B2......BN。并且数组A中的每一个元素Ai,都满足1 <= Ai <= Bi。 阅读全文
posted @ 2016-09-03 13:41 Przz 阅读(276) 评论(0) 推荐(0)
摘要:Hunter Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2014 Accepted Submission(s): 615 Problem D 阅读全文
posted @ 2016-08-27 09:45 Przz 阅读(229) 评论(0) 推荐(0)
摘要:XHXJ's LIS Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2265 Accepted Submission(s): 927 Probl 阅读全文
posted @ 2016-08-27 09:43 Przz 阅读(275) 评论(0) 推荐(0)
摘要:E - Beautiful numbers Time Limit:4000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 55D E - Beautiful number 阅读全文
posted @ 2016-08-27 09:42 Przz 阅读(202) 评论(0) 推荐(0)
摘要:湫湫系列故事——设计风景线 Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4539 Accepted Submission(s): 816 Pr 阅读全文
posted @ 2016-08-27 09:41 Przz 阅读(196) 评论(0) 推荐(0)
摘要:Balanced Number Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4624 Accepted Submission(s): 217 阅读全文
posted @ 2016-08-27 09:40 Przz 阅读(124) 评论(0) 推荐(0)
摘要:You Are the One Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3348 Accepted Submission(s): 1524 阅读全文
posted @ 2016-08-21 09:52 Przz 阅读(143) 评论(0) 推荐(0)
摘要:Food Problem Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1243 Accepted Submission(s): 368 P 阅读全文
posted @ 2016-08-21 09:50 Przz 阅读(136) 评论(0) 推荐(0)
摘要:Resource Archiver Time Limit: 20000/10000 MS (Java/Others) Memory Limit: 100000/100000 K (Java/Others)Total Submission(s): 2382 Accepted Submission(s) 阅读全文
posted @ 2016-04-30 20:59 Przz 阅读(365) 评论(0) 推荐(0)
摘要:Lost's revenge Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 3757 Accepted Submission(s): 1020 阅读全文
posted @ 2016-04-30 20:55 Przz 阅读(257) 评论(0) 推荐(0)
摘要:Ring Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3180 Accepted Submission(s): 1033 Problem De 阅读全文
posted @ 2016-04-30 20:54 Przz 阅读(454) 评论(0) 推荐(0)
摘要:Wireless Password Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5640 Accepted Submission(s): 17 阅读全文
posted @ 2016-04-30 20:52 Przz 阅读(222) 评论(0) 推荐(0)
摘要:DNA repair Time Limit: 5000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2004 Accepted Submission(s): 1085 Prob 阅读全文
posted @ 2016-04-30 20:48 Przz 阅读(390) 评论(0) 推荐(0)
摘要:A Task Process Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1332 Accepted Submission(s): 656 阅读全文
posted @ 2016-04-16 22:08 Przz 阅读(245) 评论(0) 推荐(0)
摘要:King's Game Accepts: 249 Submissions: 671 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) King's Game Accepts: 249 Su 阅读全文
posted @ 2016-03-13 13:53 Przz 阅读(141) 评论(0) 推荐(0)
摘要:小明系列问题——小明序列 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2620 Accepted Submission(s): 807 Pr 阅读全文
posted @ 2016-03-04 21:29 Przz 阅读(185) 评论(0) 推荐(0)
摘要:Man Down Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2030 Accepted Submission(s): 743 Proble 阅读全文
posted @ 2016-03-04 21:03 Przz 阅读(194) 评论(0) 推荐(0)
摘要:题意: 给你n个宝藏,然后给出他们的位置a[i]以及存在时间tim[i],如果能全部拿完,求出最短时间; 否则输出No solution 思路: 对于一段区间[i,j],你取完之后肯定是在最左端或者最右端,因为如果最后你停在中间位置,你始终会先到左右,所以并不能是最优解。 所以我们dp[i][j][ 阅读全文
posted @ 2015-11-17 11:03 Przz 阅读(142) 评论(0) 推荐(0)