动态规划/DP
从此醉
痴情种子本天生故曰向来痴相见恨晚犹断肠是名从此醉
展开
-
题目1025:最大报销额 (dfs深度优先搜索)以及 01背包求解
http://ac.jobdu.com/problem.php?pid=1025题目描述: 现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。输入:原创 2013-02-12 17:40:22 · 6642 阅读 · 1 评论 -
搬寝室-动态规划
搬寝室Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11273 Accepted Submission(s): 3781Problem Description搬寝室是很累的,xhd深有体会.时间追述2转载 2013-06-09 10:59:19 · 817 阅读 · 0 评论 -
HDU-1059-Dividing-多重背包
Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the原创 2013-06-16 11:05:22 · 1068 阅读 · 0 评论 -
简单01背包问题求解 POJ:3628 Bookshelf 2
http://poj.org/problem?id=3628DescriptionFarmer John recently bought another bookshelf for the cow library, but the shelf is getting filled up quite quickly, and now the only available s原创 2013-01-23 21:29:42 · 1493 阅读 · 0 评论 -
数位DP HOJ 3555
http://acm.hdu.edu.cn/showproblem.php?pid=3555题意就是找0到n有多少个数中含有49。数据范围接近10^20DP的状态是2维的dp[len][3]dp[len][0] 代表长度为len不含49的方案数dp[len][1] 代表长度为len不含49但是以9开头的数字的方案数dp[len][2] 代表长度为len含有49的方案数转载 2013-03-26 15:13:55 · 971 阅读 · 0 评论 -
多重背包 Piggy_Bank_1114
多重背包和01背包的区别在于,多重背包中的物品可以放入多次,只要不超过限制。01背包的内部循环是逆序的, 是因为这样可以保证,每个物品是放入一次的(循环到 j 时,j - c[i] 位置还没有放物品i)。而多重背包只是把循环颠倒,改为正序循环。(这样在循环到 j 时,j-c[i] 处已经放置了物品i, 这样就可以多次放入物品i 了)。练习题:http://acm.hdu.e原创 2013-04-16 14:49:17 · 898 阅读 · 0 评论 -
Matrix Swapping II
Matrix Swapping IITime Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 906 Accepted Submission(s): 602Problem DescriptionGiven an原创 2013-06-04 13:12:52 · 1149 阅读 · 0 评论 -
Largest Submatrix-最大子矩阵-HDU-2870
Largest SubmatrixTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 970 Accepted Submission(s): 470Problem DescriptionNow here i原创 2013-06-04 10:45:02 · 996 阅读 · 0 评论 -
DP-How to Type-2577
How to TypeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2503 Accepted Submission(s): 1171Problem DescriptionPirates have f原创 2013-06-03 11:20:51 · 956 阅读 · 1 评论 -
Human Gene Functions - LCS 动态规划 HDU-1080
Problem DescriptionIt is well known that a human gene can be considered as a sequence, consisting of four nucleotides, which are simply denoted by four letters, A, C, G, and T. Biologists have bee原创 2013-06-24 10:53:05 · 1089 阅读 · 0 评论 -
HDU 1074 状态DP
Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands i转载 2013-06-24 22:11:50 · 839 阅读 · 0 评论 -
题目1030:毕业bg 进化版01背包
暂时只想到用效率较低的递归方法解决吗,还好测试数据有点弱,没超时,哈哈。刚开始总是WA,纠结了很久,才发现应先按离开的时间排下序。 每年毕业的季节都会有大量毕业生发起狂欢,好朋友们相约吃散伙饭,网络上称为“bg”。参加不同团体的bg会有不同的感觉,我们可以用一个非负整数为每个bg定义一个“快乐度”。现给定一个bg列表,上面列出每个bg的快乐度、持续长度、bg发起人的离校时原创 2012-03-30 11:45:01 · 1565 阅读 · 0 评论 -
递推+状态压缩+动态规划-POJ-Mondriaan's Dream
DescriptionSquares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw o原创 2013-08-05 19:49:39 · 1031 阅读 · 0 评论 -
HDU 3008
Problem 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 Heroes in it,but you could only choose one转载 2013-06-27 05:51:17 · 1985 阅读 · 2 评论 -
区间DP 的两种解法
POJ 2955 为例。1 for循环/*经典的区间DP模型--最大括号匹配数。如果找到一对匹配的括号[xxx]oooo,就把区间分成两部分,一部分是xxx,一部分是ooo,然后以此递归直到区间长度为1或者为2.*/#include#include#include#includeusing namespace std;const int maxn=1转载 2013-07-01 14:18:40 · 962 阅读 · 0 评论 -
HDU 1501 Zipper 动态规划经典
ZipperTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4884 Accepted Submission(s): 1742Problem DescriptionGiven three strings原创 2013-06-26 10:24:29 · 1343 阅读 · 0 评论 -
HDU 1277 Fast Food
Problem DescriptionThe fastfood chain McBurger owns several restaurants along a highway. Recently, they have decided to build several depots along the highway, each one located at a restaurant and转载 2013-06-26 14:45:14 · 959 阅读 · 0 评论 -
HDU 1300 Pearls
Problem DescriptionIn Pearlania everybody is fond of pearls. One company, called The Royal Pearl, produces a lot of jewelry with pearls in it. The Royal Pearl has its name because it delivers to t原创 2013-06-25 21:41:42 · 1105 阅读 · 0 评论 -
HDU 1224 Free DIY Tour
Problem DescriptionWeiwei is a software engineer of ShiningSoft. He has just excellently fulfilled a software project with his fellow workers. His boss is so satisfied with their job that he decid原创 2013-06-25 10:39:09 · 1248 阅读 · 0 评论 -
hdu Max Sum Plus Plus(最大m段子段和)
1、http://acm.hdu.edu.cn/showproblem.php?pid=10242、题目大意:已知有n个数,求m段不相交的子段权值之和最大,状态转移方程:dp[i][j]表示以i为结尾元素的j个子段的数和dp[i][j]=max(dp[i-1][j]+a[i],dp[i-k][j-1]+a[i]);其中(j-1此题实现这种思想:for转载 2013-06-12 11:12:20 · 1029 阅读 · 0 评论 -
Beans-hdu-2845
BeansTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1977 Accepted Submission(s): 997Problem DescriptionBean-eating is an int原创 2013-06-03 15:55:12 · 899 阅读 · 0 评论 -
ACM 动态规划题集
动态规划是一个重点 但是从来还没有系统的练习过,下面HDU上的46道DP题和其状态转移方程,等以后练习使用这是从百度文库下载的 不知道原作者。。。1.Robberies http://acm.hdu.edu.cn/showproblem.php?pid=2955背包;第一次做的时候把概率当做背包(放大100000倍化为整数):在此范围内最多能抢多少钱 最脑残的是把总的概率以为是抢N家银转载 2013-05-31 09:48:54 · 1834 阅读 · 0 评论 -
贪心结合动态规划-POJ-1069-Monkey and Banana
Monkey and BananaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5395 Accepted Submission(s): 2765Problem DescriptionA group原创 2013-05-30 17:24:52 · 2265 阅读 · 2 评论 -
动态规划- Super Jumping! POJ-1087
Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 16653 Accepted Submission(s): 7093Problem Descrip原创 2013-05-28 16:32:28 · 1275 阅读 · 0 评论 -
动态规划-HOJ-2571
命运Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6270 Accepted Submission(s): 2207Problem Description穿过幽谷意味着离大魔王lemon已经无限接近了原创 2013-05-30 13:32:16 · 1805 阅读 · 1 评论 -
动态规划求解 最小花费
题目1086:最小花费时间限制:1 秒内存限制:32 兆特殊判题:否提交:2082解决:398题目描述:在某条线路上有N个火车站,有三种距离的路程,L1,L2,L3,对应的价格为C1,C2,C3.其对应关系如下:距离s 票价0L1L2输入保证0每两个站之间的距离不超过L3。当乘客要移原创 2013-04-16 18:36:12 · 1727 阅读 · 0 评论 -
动态规划-Largest Rectangle in a Histogram- HOJ 1506
Largest Rectangle in a HistogramTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7296 Accepted Submission(s): 2037Problem Descript原创 2013-05-28 14:06:16 · 918 阅读 · 0 评论 -
动态规划-面积最大的全1子矩阵
题目描述:在一个M * N的矩阵中,所有的元素只有0和1,从这个矩阵中找出一个面积最大的全1子矩阵,所谓最大是指元素1的个数最多。输入:输入可能包含多个测试样例。对于每个测试案例,输入的第一行是两个整数m、n(1矩阵共有m行,每行有n个整数,分别是0或1,相邻两数之间严格用一个空格隔开。输出:对应每个测试案例,输出矩阵中面积最转载 2013-05-22 14:11:00 · 3978 阅读 · 1 评论 -
动态规划1-Robberies-POJ-2955
RobberiesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7107 Accepted Submission(s): 2666Problem DescriptionThe aspiring Roy原创 2013-05-27 10:48:10 · 1755 阅读 · 0 评论 -
多重背包练习-计数法-POJ-1276-Cash Machine
Cash MachineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions:22644 Accepted: 7943DescriptionA Bank plans to install a machine for cash withdrawal. The m原创 2013-05-31 14:37:45 · 2007 阅读 · 1 评论 -
完全背包练习-POJ-1384-Piggy-Bank
Piggy-BankDescriptionBefore ACM can do anything, a budget must be prepared and the necessary financial support obtained. The main income for this action comes from Irreversibly Bound Money原创 2013-05-31 12:27:30 · 961 阅读 · 0 评论 -
FATE-HDU-2159-动态规划 计数法
FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5189 Accepted Submission(s): 2343Problem Description最近xhd正在玩一款叫做FATE的游戏,为原创 2013-06-02 22:05:09 · 821 阅读 · 0 评论 -
多重背包-未优化-HDU-2191
Input输入数据首先包含一个正整数C,表示有C组测试用例,每组测试用例的第一行是两个整数n和m(1 Output对于每组测试数据,请输出能够购买大米的最多重量,你可以假设经费买不光所有的大米,并且经费你可以不用完。每个实例的输出占一行。 Sample Input18 22 100 44 100 2原创 2013-06-11 20:00:43 · 897 阅读 · 0 评论 -
求单调序列的nlogn算法-HDU-1025
Constructing Roads In JGShining's KingdomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11464 Accepted Submission(s): 3283Proble原创 2013-06-12 15:57:43 · 911 阅读 · 0 评论 -
FatMouse's Speed-HDU-动态规划
FatMouse's SpeedTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6929 Accepted Submission(s): 3028Special JudgeProblem Description原创 2013-06-12 13:04:21 · 915 阅读 · 0 评论 -
搜索 hdu 1978 How many ways
Problem Description这是一个简单的生存游戏,你控制一个机器人从一个棋盘的起始点(1,1)走到棋盘的终点(n,m)。游戏的规则描述如下:1.机器人一开始在棋盘的起始点并有起始点所标有的能量。2.机器人只能向右或者向下走,并且每走一步消耗一单位能量。3.机器人不能在原地停留。4.当机器人选择了一条可行路径后,当他走到这条路径的终点时,他将只有终点所标记的能量。转载 2013-06-11 15:14:46 · 780 阅读 · 0 评论 -
动态规划优化之使用Map记忆化搜索
已此题为例:http://acm.hdu.edu.cn/showproblem.php?pid=1864原来的解法:http://blog.csdn.net/gaotong2055/article/details/8579388上面的解法中DFS太耗时。就算是使用典型的动态规划,耗费空间,数组开的太大,有很多浪费,有太多的无用循环,也会耗时(200ms左右)。原创 2013-05-27 13:03:54 · 1285 阅读 · 0 评论 -
动态规划-免费的馅饼-HOJ-1176
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18519 Accepted Submission(s): 6193Problem Description都说天上不会掉馅饼,但有一天gamebo原创 2013-06-01 12:45:44 · 920 阅读 · 0 评论 -
I need A offer! POJ-1203
I NEED A OFFER!Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11898 Accepted Submission(s): 4566Problem DescriptionSpeakless原创 2013-06-01 13:28:43 · 930 阅读 · 0 评论 -
网易有道2013年校园招聘面试二面试题-项目安排
题目来源:http://ac.jobdu.com/problem.php?pid=1499题目描述:小明每天都在开源社区上做项目,假设每天他都有很多项目可以选,其中每个项目都有一个开始时间和截止时间,假设做完每个项目后,拿到报酬都是不同的。由于小明马上就要硕士毕业了,面临着买房、买车、给女友买各种包包的鸭梨,但是他的钱包却空空如也,他需要足够的money来充实钱包。万能的网友麻烦你来帮帮小原创 2013-07-31 15:03:42 · 1676 阅读 · 0 评论