DP
文章平均质量分 71
sxk_sxy
努力用自己辛勤的汗水,成为一名真正的ACMer
展开
-
UVa 10534 Wavio Sequence (LIS、LDS)
E - Wavio SequenceTime Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %lluSubmit Status DescriptionProblem DWavio Sequence Input: Standard Input Output: Standa原创 2014-07-26 23:49:40 · 917 阅读 · 0 评论 -
hdu 1087 Super Jumping! Jumping! Jumping! (LIS)
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24549 Accepted Submission(s): 10838Problem Desc原创 2015-03-02 20:44:11 · 752 阅读 · 0 评论 -
URAL 1225. Flags (dp)
1225. FlagsTime limit: 1.0 secondMemory limit: 64 MBOn the Day of the Flag of Russia a shop-owner decided to decorate the show-window of his shop with textile stripes of white, blue an原创 2015-03-07 14:05:02 · 937 阅读 · 0 评论 -
HDU 1203 I NEED A OFFER! (01背包)
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18689 Accepted Submission(s): 7492Problem DescriptionSpeakless很早原创 2015-05-03 17:35:24 · 755 阅读 · 0 评论 -
HDU 2955 Robberies (01背包)
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5181 Accepted Submission(s): 1958Problem DescriptionThe aspiring R原创 2015-05-03 11:14:23 · 674 阅读 · 0 评论 -
HDU 1864 最大报销额 (01背包)
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 18388 Accepted Submission(s): 5391Problem Description现有一笔经费可以报销一定额度的发票。允许报原创 2015-05-03 15:53:40 · 644 阅读 · 0 评论 -
Codeforces Round #261 (Div. 2) E. Pashmak and Graph (sorting + dp)
E. Pashmak and Graphtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputPashmak's homework is a problem about graphs. Altho原创 2015-06-18 18:17:26 · 923 阅读 · 0 评论 -
HLJU 1223: 寻找区间和 (交替推进法)
1223: 寻找区间和Time Limit: 3 Sec Memory Limit: 128 MBSubmit: 13 Solved: 4[Submit][Status][Web Board]DescriptionN个正整数组成的序列(N例如序列:1 2 3 1 5 且 K=6时,满足的区间有[1,3],[2,4],[4,5]三个。Input原创 2015-06-11 12:14:23 · 906 阅读 · 0 评论 -
HDU 2296 Ring (AC自动机 + DP)
题目链接:Ring解析:m个有价值的串,字符串s在字符串str中的价值 = s在str中出现的次数 × s的价值。问价值最大的长度为n的串是什么。本题需要输出字典序最小的在DP的时候开一个数组记录结果即可。AC代码:#include #include #include #include #include using namespace std;原创 2015-08-15 17:37:25 · 634 阅读 · 0 评论 -
HDU 2457 DNA repair (AC自动机 + DP)
题目链接:DNA repair解析:给出n个致病DNA序列,给一段DNA片段,问最少修改多少个碱基才能修复这段DNA序列中的所有致病序列。AC自动机 + DP。将n个致病DNA序列构成一个自动机。令DP[i][j]表示长度为i走到节点j是所需改变的最少个数。状态转移时,枚举下一步所有可能的碱基,然后判断该碱基是否达到匹配状态,若能,则安全转移,继续枚举下一个碱基;否则在原创 2015-08-17 11:49:59 · 644 阅读 · 0 评论 -
ZOJ 3494 BCD Code (AC自动机 + 数位DP)
题目链接:BCD Code解析:n个病毒串,问给定区间上有多少个转换成BCD码后不包含病毒串的数。非常神奇的题目。。经典的 AC自动机 + 数位DP 的题目。首先使用AC自动机,得到bcd[i][j]表示状态i,加了数字j以后到达的状态,为-1表示不能转移然后就是数位DP了注意记录为0的状态AC代码:#include #include原创 2015-08-18 13:35:32 · 1165 阅读 · 0 评论 -
2013 ACM-ICPC吉林通化全国邀请赛 && HDU 4597 Play Game (博弈 + 区间dp)
Play GameTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 1185 Accepted Submission(s): 685Problem DescriptionAlice and Bob are playing原创 2015-10-02 12:59:18 · 901 阅读 · 1 评论 -
POJ 2533 Longest Ordered Subsequence (LIS)
Longest Ordered SubsequenceTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 35930 Accepted: 15779DescriptionA numeric sequence of ai is ordered if a1原创 2015-03-02 20:11:56 · 598 阅读 · 0 评论 -
hdu 2084 & POJ 1163 数塔 (dp)
数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 24626 Accepted Submission(s): 14814Problem Description在讲述DP算法的时候,一个经典的例子就原创 2015-01-30 20:18:35 · 797 阅读 · 0 评论 -
HDU 1159 & POJ 1458 Common Subsequence (LCS)
A - Common SubsequenceTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionA subsequence of a given sequence is the given sequence with some e原创 2014-08-04 09:41:46 · 749 阅读 · 0 评论 -
HDU1203 I NEED A OFFER! (dp)
I NEED A OFFER!Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交原创 2014-08-04 11:38:20 · 659 阅读 · 0 评论 -
HDU 1160 FatMouse's Speed(LDS)
AC代码:#include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define INF 0x7fffffffconst int maxn = 1000 + 10;原创 2014-08-04 12:26:52 · 665 阅读 · 0 评论 -
HDU 1421 搬寝室 (dp)
搬寝室Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16940 Accepted Submission(s): 5749Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年原创 2014-08-04 15:52:17 · 752 阅读 · 0 评论 -
ACdream 1154 Lowbit Sum (数位DP)
Lowbit SumTime Limit: 2000/1000MS (Java/Others)Memory Limit: 128000/64000KB (Java/Others)Submit StatusProblem Descriptionlong long ans = 0;for(int i = 1; i ans += lowbit(i)原创 2014-10-04 15:46:07 · 1368 阅读 · 0 评论 -
浅谈动态规划
这里是一些经典的dp问题,给大家分享一下~~~Robberies http://acm.hdu.edu.cn/showproblem.php?pid=2955 背包;第一次做的时候把概率当做背包(放大100000倍化为整数):在此范围内最多能抢多少钱 最脑残的是把总的概率以为是抢N家银行的概率之和… 把状态转移方程写成了f[j]=max{f[j],f[j-原创 2014-03-28 06:40:37 · 718 阅读 · 0 评论 -
通过金矿模型介绍动态规划(讲得真心不错~~~)
通过金矿模型讲动态规划----第一节----初识动态规划-------- 经典的01背包问题是这样的: 有一个包和n个物品,包的容量为m,每个物品都有各自的体积和价值,问当从这n个物品中选择多个物品放在包里而物品体积总数不超过包的容量m时,能够得到的最大价值是多少?[对于每个物品不可以取多次,最多只能取一次,之所以叫原创 2014-07-24 09:40:11 · 1514 阅读 · 0 评论 -
2014ACM/ICPC亚洲区域赛牡丹江站现场赛-D ( ZOJ 3822 ) Domonation
题目链接:DominationTime Limit: 8 Seconds Memory Limit: 131072 KB Special JudgeEdward is the headmaster of Marjar University. He is enthusiastic about chess and often plays原创 2014-10-17 21:54:22 · 1275 阅读 · 0 评论 -
Codeforces Round #274 (Div. 2) --C Exams
题目链接:ExamsExamstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Valera is an undergrad原创 2014-10-20 17:09:13 · 1123 阅读 · 5 评论 -
hdu 1003 Max Sum (贪心)
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 156188 Accepted Submission(s): 36520Problem DescriptionGiven a s原创 2015-01-13 14:41:46 · 1360 阅读 · 0 评论 -
HDU 1052 Tian Ji -- The Horse Racing (贪心)
这是一道很经典的贪心题目~~~ Tian Ji -- The Horse RacingTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionHere is a famous story in C原创 2014-07-26 21:34:03 · 1202 阅读 · 2 评论 -
UVA 10891 Game of Sum (博弈论 + 区间dp)
Game of SumTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionThis is a two player game. Initially there are n integer numbers in an array and pl原创 2015-10-02 14:27:39 · 547 阅读 · 0 评论