动态规划(dp)
文章平均质量分 80
GKHack
这个作者很懒,什么都没留下…
展开
-
Openjudge7219 复杂的整数划分问题(dp)
总时间限制: 200ms 内存限制: 65536kB描述将正整数n 表示成一系列正整数之和,n=n1+n2+…+nk, 其中n1>=n2>=…>=nk>=1 ,k>=1 。正整数n 的这种表示称为正整数n 的划分。输入标准的输入包含若干组测试数据。每组测试数据是一行输入数据,包括两个整数N 和 K。 (0 输出对于每组测试数据,输出以下三行数据:第一原创 2015-08-05 16:53:26 · 1475 阅读 · 0 评论 -
Openjudge187 炮兵阵地(dp)
总时间限制: 2000ms 内存限制: 65536kB描述司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示:如果在地图中的灰色所标识的原创 2015-08-05 16:47:46 · 1104 阅读 · 0 评论 -
HDOJ1231 最大连续子序列(dp)
题目链接:点击打开链接给出一个序列, 让你输出子序列最大和以及子序列的起点和终点的值, 最大和为负则输出0以及序列的起点和终点的值.对每个读入的数累加, 比ans大则更新ans与起点终点, 若加到某处小于0则更新tmp与起点.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include原创 2015-10-15 09:07:12 · 920 阅读 · 0 评论 -
HDOJ1159 Common Subsequence(dp)
题目链接:点击打开链接给出两个字符串, 问你最长公共子序列有多长.lcs模板题目, 摘出求解过程:第一步:先计算最长公共子序列的长度。第二步:根据长度,然后通过回溯求出最长公共子序列。设一个C[i,j]: 保存Xi与Yj的LCS的长度。递推方程为:AC代码:#include "iostream"#includ原创 2015-10-15 09:31:48 · 902 阅读 · 0 评论 -
POJ2250 Compromise(dp)
题目链接:点击打开链接给出两段字符串数组, 每段以"#"结尾, 要求输出两段字符串数组最长的公共字符串.lcs题目, 增加了一个flag数组保存字符串比较结果, 用于最后递归数据答案.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using na原创 2015-10-15 09:39:49 · 1360 阅读 · 0 评论 -
BestCoder Round #63 (div.2) HDOJ5568 sequence2(dp + 大数)
sequence2Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 231 Accepted Submission(s): 95Problem DescriptionGiven an integer ar原创 2015-11-22 21:15:29 · 927 阅读 · 0 评论 -
BestCoder Round #63 (div.2) HDOJ5569 matrix(dp)
matrixTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 304 Accepted Submission(s): 187Problem DescriptionGiven a matrix with n原创 2015-11-22 23:19:49 · 1034 阅读 · 0 评论 -
BestCoder Round #62 (div.2) HDOJ5564 Clarke and digits(dp + 快速幂)
Clarke and digitsTime Limit: 5000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 88 Accepted Submission(s): 44Problem DescriptionClarke is a原创 2015-11-18 10:55:40 · 1314 阅读 · 0 评论 -
Codeforces Round #336 (Div. 2) 608B Hamming Distance Sum(dp)
B. Hamming Distance Sumtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGenos needs your help. He was asked原创 2015-12-29 00:40:32 · 918 阅读 · 0 评论 -
Good Bye 2015 C New Year and Domino(dp)
C. New Year and Dominotime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThey say "years are like dominoes, t原创 2016-01-01 00:41:58 · 978 阅读 · 0 评论 -
Codeforces Round #338 (Div. 2) 615B Longtail Hedgehog(dp)
B. Longtail Hedgehogtime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThis Christmas Santa gave Masha a magi原创 2016-01-09 21:02:17 · 823 阅读 · 0 评论 -
Codeforces Round #338 (Div. 2) 615C Running Track(dp)
C. Running Tracktime limit per test1 secondmemory limit per test512 megabytesinputstandard inputoutputstandard outputA boy named Ayrat lives on planet AMI-1511.原创 2016-01-09 21:53:35 · 988 阅读 · 0 评论 -
POJ3249 Test for Job(拓扑排序+dp)
Test for JobTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 10137 Accepted: 2348DescriptionMr.Dog was fired by his company. In order to support his原创 2015-12-08 20:09:10 · 1607 阅读 · 0 评论 -
Codeforces Round #336 (Div. 2) 608C Chain Reaction(dp)
C. Chain Reactiontime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n beacons located at distinct p原创 2015-12-27 18:20:23 · 1131 阅读 · 0 评论 -
Openjudge4977 怪盗基德的滑翔翼(dp)
总时间限制: 1000ms 内存限制: 65536kB描述怪盗基德是一个充满传奇色彩的怪盗,专门以珠宝为目标的超级盗窃犯。而他最为突出的地方,就是他每次都能逃脱中村警部的重重围堵,而这也很大程度上是多亏了他随身携带的便于操作的滑翔翼。有一天,怪盗基德像往常一样偷走了一颗珍贵的钻石,不料却被柯南小朋友识破了伪装,而他的滑翔翼的动力装置也被柯南踢出的足球破坏了。不得原创 2015-08-05 17:21:24 · 2158 阅读 · 0 评论 -
ACdream1113 The Arrow(概率dp)
The ArrowTime Limit: 2000/1000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)Submit Statistic Next ProblemProblem DescriptionThe history shows that We need heroes in ever原创 2015-08-08 08:39:10 · 642 阅读 · 0 评论 -
UVA11401 Triangle Counting(递推,dp)
自己公式推错了,可是我测试了好多都没问题,不知道错在哪里。 这题的WA点很奇怪,也很多。。AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 1000010;typedef long原创 2015-08-12 18:48:21 · 1128 阅读 · 2 评论 -
Codeforces Round #318 574D Bear and Blocks(dp)
D. Bear and Blockstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little bear who loves to play.原创 2015-08-30 11:05:38 · 1118 阅读 · 0 评论 -
Codeforces Round #319 (Div. 2) 577B Modulo Sum(dp)
B. Modulo Sumtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a sequence of numbers a1, a2, .原创 2015-09-12 15:05:56 · 1048 阅读 · 0 评论 -
HDOJ1421 搬寝室(dp)
搬寝室Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21643 Accepted Submission(s): 7357Problem Description搬寝室是很累的,xhd深有体会.时间追述2原创 2015-08-29 20:12:33 · 827 阅读 · 0 评论 -
HDOJ5245 Joyful(dp)
JoyfulTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 506 Accepted Submission(s): 219Problem DescriptionSakura has a very mag原创 2015-08-22 18:28:42 · 999 阅读 · 2 评论 -
POJ1745 Divisibility(dp)
DivisibilityTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11053 Accepted: 3953DescriptionConsider an arbitrary sequence of integers. One can place +原创 2015-08-29 15:09:08 · 1038 阅读 · 0 评论 -
HDOJ5074 Hatsune Miku(dp)
Hatsune MikuTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 989 Accepted Submission(s): 688Problem DescriptionHatsune Miku原创 2015-09-07 23:42:16 · 1000 阅读 · 0 评论 -
Codeforces Round #302 (Div. 1) 543A Writing Code(dp)
A. Writing Codetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProgrammers working on a large project have原创 2015-09-03 19:37:02 · 991 阅读 · 0 评论 -
BestCoder Round #50 (div.2) & HDOJ5366 The mook jong(dp)
Problem DescriptionZJiaQ want to become a strong man, so he decided to play the mook jong。ZJiaQ want to put some mook jongs in his backyard. His backyard consist of n bricks that is 1*1,so it is原创 2015-08-09 10:37:48 · 999 阅读 · 0 评论 -
Codeforces Round #Pi (Div. 2)567C Geometric Progression(dp + map)
C. Geometric Progressiontime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp loves geometric progressio原创 2015-08-06 11:07:41 · 977 阅读 · 0 评论 -
Codeforces Round #315 (Div. 2)569D Symmetric and Transitive(dp)
D. Symmetric and Transitivetime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle Johnny has recently le原创 2015-08-12 08:51:13 · 1364 阅读 · 0 评论 -
HDOJ5256 序列变换(dp)
序列变换Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 854 Accepted Submission(s): 345Problem Description我们有一个数列A1,A2...An,你现在要求原创 2015-08-22 00:39:54 · 801 阅读 · 0 评论 -
HDOJ2041 超级楼梯(dp & 打表)
超级楼梯Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 38263 Accepted Submission(s): 19688Problem Description有一楼梯共M级,刚开始时你在第一级,若原创 2015-08-13 23:58:05 · 989 阅读 · 0 评论 -
Codeforces Round #267 (Div. 2)467C George and Job(dp)
C. George and Jobtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe new ITone 6 has been released recently原创 2015-08-22 17:36:13 · 1144 阅读 · 0 评论 -
HDOJ3336 Count the string(kmp + dp)
题目链接:点击打开链接给你字符串的长度以及这个字符串,问你前缀数量之和是多少。利用kmp中next数组的性质,将该跳多少位保存到nxt数组中,dp数组保存当前子串i所含前缀数量之和,dp[i] = (dp[nxt[i]] + 1) % MOD计算当前结尾子串i数量加上前nxt[i]个字符这一前缀的数量。AC代码:#include "iostream"#incl原创 2015-10-06 23:40:10 · 1070 阅读 · 0 评论 -
Codeforces Round #336 (Div. 2) 608D Zuma(dfs+dp)
D. Zumatime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputGenos recently installed the game Zuma on his phone原创 2015-12-27 18:32:46 · 1062 阅读 · 0 评论