[ACM]_动态规划
同学少年
没有什么不可能!
展开
-
[ACM] SDUT 2607 Mountain Subsequences
Mountain SubsequencesTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述Coco is a beautiful ACMer girl living in a very beautiful mountain. There are many trees and flowers on the原创 2015-04-07 20:21:14 · 1544 阅读 · 0 评论 -
[ACM] hdu 5001 Walk (概率DP)
WalkProblem DescriptionI used to think I could be anything, but now I know that I couldn't do anything. So I started traveling.The nation looks like a connected bidirectional graph, and原创 2014-09-17 17:23:32 · 1791 阅读 · 0 评论 -
[ACM] POJ 2677 Tour (动态规划,双调欧几里得旅行商问题)
TourTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3585 Accepted: 1597DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he r原创 2014-08-07 10:05:18 · 3210 阅读 · 0 评论 -
[2013山东ACM省赛] The number of steps (概率DP,数学期望)
The number of stepsTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述 Mary stands in a strange maze, the maze looks like a triangle(the first layer have one room,the seco原创 2014-05-05 17:53:54 · 2506 阅读 · 0 评论 -
[ACM] ural 1057 Amount of degrees (数位统计)
1057. Amount of DegreesTime limit: 1.0 secondMemory limit: 64 MBCreate a code to determine the amount of integers, lying in the set [X;Y] and being a sum of exactlyK different integer de原创 2014-08-07 17:14:01 · 1945 阅读 · 0 评论 -
[ACM] POJ 2593 Max Sequence (动态规划,最大字段和)
Max SequenceTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 15569 Accepted: 6538DescriptionGive you N integers a1, a2 ... aN (|ai| You should ou原创 2014-08-06 10:47:59 · 2389 阅读 · 0 评论 -
[ACM] POJ 1141 Brackets Sequence (区间动态规划)
Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25087 Accepted: 7069 Special JudgeDescriptionLet us define a regular brackets seq原创 2014-08-06 10:02:15 · 2343 阅读 · 0 评论 -
[ACM] POJ 2479 Maximum sum (动态规划求不相交的两段子段和的最大值)
Maximum sumTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33363 Accepted: 10330DescriptionGiven a set of n integers: A={a1, a2,..., an}, we define a原创 2014-08-06 10:42:37 · 3676 阅读 · 0 评论 -
[ACM] hdu 4248 A Famous Stone Collector (DP+组合)
A Famous Stone CollectorProblem DescriptionMr. B loves to play with colorful stones. There are n colors of stones in his collection. Two stones with the same color are indistinguishable. M原创 2014-07-30 15:15:56 · 1826 阅读 · 0 评论 -
[ACM] ZOJ 3725 Painting Storages (DP计数+组合)
Painting StoragesTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a straight highway with N storages alongside it labeled by 1,2,3,...,N. Bob asks you to paint all storages with two原创 2014-07-25 14:01:52 · 1980 阅读 · 0 评论 -
[ACM] 九度OJ 合唱队形 (最长递增子序列改版)
题目1131:合唱队形 时间限制:1 秒内存限制:32 兆特殊判题:否提交:1680解决:520题目描述: N位同学站成一排,音乐老师要请其中的(N-K)位同学出列,使得剩下的K位同学不交换位置就能排成合唱队形。合唱队形是指这样的一种队形:设K位同学从左到右依次编号为1, 2, …, K,他们的身高分别为T1, T2, …, TK,则他们的身高满原创 2014-04-29 20:59:02 · 1917 阅读 · 0 评论 -
[ACM] FZU 2092 收集水晶 (DFS,记忆化搜索)
Problem Descriptionshadow来到一片神奇的土地,这片土地上不时会出现一些有价值的水晶,shadow想要收集一些水晶带回去,但是这项任务太繁杂了,于是shadow让自己的影子脱离自己并成为一个助手来帮助自己收集这些水晶。shadow把这片土地划分成n*m个小方格,某些格子会存在一些shadow和他的影子都无法穿越的障碍,比如巨石、树木、野兽等。shadow预先探测到原创 2014-10-22 11:13:37 · 1863 阅读 · 0 评论 -
[ACM] HDU 5074 Hatsune Miku (简单DP)
Hatsune MikuProblem DescriptionHatsune Miku is a popular virtual singer. It is very popular in both Japan and China. Basically it is a computer software that allows you to compose a song on yo原创 2014-10-23 10:23:58 · 2431 阅读 · 0 评论 -
hihoCoder挑战赛7 1001 正则表达式 (区间DP)
http://hihocoder.com/contest/challenge7/problem/1描述给定一个字符串,判断其是否为合法的正则表达式。 一个正则表达式定义为: 1:0是正则表达式,1也是正则表达式。 2:P和Q都是正则表达式,则PQ是正则表达式。 3:P是正则表达式,则(P)是正则表达式 4:P是正则表达式,则P*也是正则表达式 5:P和Q都是原创 2015-04-05 20:12:55 · 1798 阅读 · 0 评论 -
简单动态规划两题(思想一样)
ZOJ 3725 Painting Storages DP计数Painting StoragesTime Limit: 2 Seconds Memory Limit: 65536 KBThere is a straight highway with N storages alongside it labeled by 1,2,3,...,N原创 2015-03-25 17:10:28 · 1672 阅读 · 0 评论 -
[ACM] HDU 5025 Saving Tang Monk (状态压缩,BFS)
Saving Tang MonkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 941 Accepted Submission(s): 352Problem Description《Journey to t原创 2014-10-21 22:12:12 · 2624 阅读 · 0 评论 -
[ACM] hihoCoder 1075 开锁魔法III (动态规划,组合数学)
描述一日,崔克茜来到小马镇表演魔法。其中有一个节目是开锁咒:舞台上有 n 个盒子,每个盒子中有一把钥匙,对于每个盒子而言有且仅有一把钥匙能打开它。初始时,崔克茜将会随机地选择 k 个盒子用魔法将它们打开。崔克茜想知道最后所有盒子都被打开的概率,你能帮助她回答这个问题吗?输入第一行一个整数 T (T ≤ 100)表示数据组数。 对于每组数据,第一行有两个整数 n 和 k (1 ≤原创 2014-11-13 20:50:04 · 2546 阅读 · 0 评论 -
[ACM] hdu 5045 Contest (状态压缩Dp)
ContestProblem DescriptionIn the ACM International Collegiate Programming Contest, each team consist of three students. And the teams are given 5 hours to solve between 8 and 12 programming pr原创 2014-10-01 15:32:29 · 1701 阅读 · 0 评论 -
[ACM] POJ 2342 Anniversary party (树形DP入门题)
Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4410 Accepted: 2496DescriptionThere is going to be a party to celebrate the 80-th Ann原创 2014-10-28 11:27:54 · 3508 阅读 · 3 评论 -
[ACM] POJ 3254 Corn Fields(状态压缩)
Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8062 Accepted: 4295DescriptionFarmer John has purchased a lush new rectangular pasture compos原创 2014-10-01 10:48:00 · 1723 阅读 · 0 评论 -
[BestCoder Round #3] hdu 4909 String (状压,计数)
StringProblem DescriptionYou hava a non-empty string which consists of lowercase English letters and may contain at most one '?'. Let's choose non-empty substring G from S (it can be G = S原创 2014-08-05 16:56:34 · 2041 阅读 · 0 评论 -
[ACM] HDU 1400 Mondriaan's Dream (状态压缩,长2宽1长方形铺满)
Mondriaan's DreamTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 783 Accepted Submission(s): 506Problem Description Squares原创 2014-10-10 09:08:36 · 1805 阅读 · 0 评论 -
[ACM] HDU 1227 Fast Food (经典Dp)
Fast FoodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2173 Accepted Submission(s): 930Problem DescriptionThe fastfood chain原创 2014-10-09 15:35:04 · 2713 阅读 · 0 评论 -
[ACM] n个数分为m部分,要求每部分的和乘起来积最大(区间DP)
A - 爱管闲事春希非常爱管闲事,他每天都会抽空帮助一些同学,由于春希非常死板,出于公平性,春希不会先帮助后来找他的同学。现在有n个同学需要他的帮助,虽然他很想一天之类帮助所有人,但毕竟精力有限,于是他决定分m天来帮助他们。根据事情的重要性,春希帮助不同同学会有不同的快乐值,而春希获得的总的快乐值为每天获得的快乐值的乘积。现在给出n和m,以及帮助完各同学时获得的快乐值,原创 2014-05-27 20:56:21 · 3266 阅读 · 7 评论 -
[ACM] hdu 1058 Humble Numbers
解题思路:一个humble数指素数因子只有2,3 , 5, 7的数,比如1(也是), 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25...而11就不是,因为11是它的素数因子。第N个Humble数肯定是前n-1个数中的一个与(2,3,5,7)的乘积。 f[n]=min(f[a]*2,f[b]*3,f[c]*4,f原创 2014-03-11 20:48:50 · 978 阅读 · 0 评论 -
[ACM]最长回文子串
题目:输入一行字符串,包括标点符号,空格和大小写字母,输出其最长回文串,忽略字母的大小写,空格和符号比如字符串 sabc, , Cba 则输出abc, , Cba代码:#include #include #include using namespace std;const int maxn=5010;string s;char buf[maxn];//存原创 2014-03-04 21:00:15 · 1500 阅读 · 0 评论 -
[ACM] hdu 2191 珍惜现在,感恩生活 (多重背包)
Problem Description急!灾区的食物依然短缺!为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。请问:你用有限的资金最多能采购多少公斤粮食呢?后记:人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。月有阴晴圆缺原创 2014-04-22 11:24:17 · 1792 阅读 · 2 评论 -
[ACM] hdu 1864 最大报销额(01背包或贪心)
最大报销额Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14982 Accepted Submission(s): 4240Problem Description 现有一笔经费可以报销一定额度的发票。原创 2014-04-06 23:05:16 · 2459 阅读 · 2 评论 -
[ACM] hdu 1114 Piggy-Bank(完全背包)
Piggy-BankTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9921 Accepted Submission(s): 4997Problem Description Before ACM can原创 2014-03-20 17:45:50 · 1788 阅读 · 0 评论 -
[ACM] hdu 2084 数塔 (简单DP)
Problem Description在讲述DP算法的时候,一个经典的例子就是数塔问题,它是这样描述的:有如下所示的数塔,要求从顶层走到底层,若每一步只能走到相邻的结点,则经过的结点的数字之和最大是多少?已经告诉你了,这是个DP的题目,你能AC吗? Input输入数据首先包括一个整数C,表示测试实例的个数,每个测试实例的第一行是一个整数N(1原创 2014-03-24 21:30:03 · 1349 阅读 · 0 评论 -
[ACM] hdu 2602 Bone Collector(01背包)
Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 25042 Accepted Submission(s): 10147Problem Description Many yea原创 2014-03-20 17:30:14 · 1332 阅读 · 0 评论 -
[ACM] hdu 1260 Tickets (动态规划)
TicketsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Size: ←原创 2014-05-03 14:12:45 · 2450 阅读 · 0 评论 -
[ACM] hdu 1231 最大连续子序列 (动规复习)
代码:#include #include #include #include using namespace std;const int maxn=10003;const int inf=0x7fffffff;int num[maxn];int n;int main(){ while(scanf("%d",&n)!=EOF&&n)原创 2014-05-03 09:22:01 · 1433 阅读 · 0 评论 -
[ACM] hdu 1087 Super Jumping! Jumping! Jumping! (动态规划)
Super Jumping! Jumping! Jumping!Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 6 Accepted Submission(s) : 5Font: Times New Roman | Verdan原创 2014-05-02 20:26:19 · 1815 阅读 · 0 评论 -
[ACM] hdu 1003 Max Sum(最大子段和模型)
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 135262 Accepted Submission(s): 31311Problem Description Given a sequen原创 2014-04-30 09:33:13 · 1751 阅读 · 0 评论 -
[ACM] hdu 1029 Ignatius and the Princess IV (动归或hash)
Ignatius and the Princess IVTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32767K (Java/Other)Total Submission(s) : 7 Accepted Submission(s) : 3Font: Times New Roman | Verdana |原创 2014-05-02 16:07:03 · 2265 阅读 · 0 评论 -
[ACM] hdu 2844 Coins (多重背包)
CoinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6347 Accepted Submission(s): 2589Problem Description Whuacmers use coins原创 2014-04-22 11:28:41 · 1779 阅读 · 0 评论 -
[ACM] poj 1141 Brackets Sequence (动态规划)
Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23884 Accepted: 6727 Special JudgeDescriptionLet us define a regular brackets sequenc原创 2014-04-22 20:39:15 · 1860 阅读 · 0 评论 -
[ACM] hdu 龟兔赛跑
龟兔赛跑Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 3 Accepted Submission(s) : 2Font: Times New Roman | Verdana | GeorgiaFont Si原创 2014-01-26 22:10:04 · 4717 阅读 · 2 评论 -
[ACM] hdu 1203 I NEED A OFFER!(小数背包)
解题思路:求至少收到一份OFFER的最大概率,为了简化问题,求一份OFFER也没有收到的最小概率,然后1减去它就可以了。采用01背包,装入一份OFFER也没收到总概率的最小值,那么1减去它就是收到至少一份OFFER的最大概率。注意:dp[最大容量] 要有值,初始化时,而且本题dp数组初始化值为1代码:#include #include #include using name原创 2014-04-29 11:41:29 · 1628 阅读 · 0 评论