动态规划
wlxsq
美丽的风景总是在远方
展开
-
【洛谷】P1060 开心的金明【动规】
链接:题目题目描述金明今天很开心,家里购置的新房就要领钥匙了,新房里有一间他自己专用的很宽敞的房间。更让他高兴的是,妈妈昨天对他说:“你的房间需要购买哪些物品,怎么布置,你说了算,只要不超过N元钱就行”。今天一早金明就开始做预算,但是他想买的东西太多了,肯定会超过妈妈限定的N元。于是,他把每件物品规定了一个重要度,分为5等:用整数1~5表示,第5等最重要。他还从原创 2017-12-17 13:41:06 · 275 阅读 · 0 评论 -
【完全背包/母函数/递推】HDU1028-Ignatius and the Princess III
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1028Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says."The se原创 2016-08-14 23:43:59 · 829 阅读 · 1 评论 -
【01背包求方案数】HDU4815-Little Tiger vs. Deep Monkey
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4815Problem DescriptionA crowd of little animals is visiting a mysterious laboratory – The Deep Lab of SYSU.“Are you surprised by the原创 2016-08-22 14:32:47 · 674 阅读 · 0 评论 -
【多维01背包】HDU4501-小明系列故事——买年货
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=4501这个题目其实是HDU3236的简化版,链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3236Problem Description 春节将至,小明要去超市购置年货,于是小明去了自己经常去的都尚超市。原创 2016-08-22 11:28:45 · 391 阅读 · 0 评论 -
【01背包+限制条件】HDU5188-zhx and contest【BestCoder Round #33】
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=5188Problem DescriptionAs one of the most powerful brushes in the world, zhx usually takes part in all kinds of contests.One day, zhx t原创 2016-08-22 10:28:53 · 284 阅读 · 0 评论 -
【01背包+完全背包】HDU3449-Consumer
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3449Problem DescriptionFJ is going to do some shopping, and before that, he needs some boxes to carry the different kinds of stuff he is原创 2016-08-20 10:19:56 · 280 阅读 · 0 评论 -
【二维01背包+限制条件】HDU3236-Gift Hunting
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3236Problem DescriptionAfter winning two coupons for the largest shopping mart in your city, you can't wait inviting your girlfriend for原创 2016-08-19 09:40:29 · 503 阅读 · 0 评论 -
【01背包-Kth优解】HDU2639-Bone Collector II
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=2639Problem DescriptionThe title of this problem is familiar,isn't it?yeah,if you had took part in the "Rookie Cup" competition,you must原创 2016-08-18 11:47:11 · 380 阅读 · 0 评论 -
【树形DP】HDU1561-The more, The Better
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1561Problem DescriptionACboy很喜欢玩一种战略游戏,在一个地图上,有N座城堡,每座城堡都有一定的宝物,在每次游戏中ACboy允许攻克M个城堡并获得里面的宝物。但由于地理位置原因,有些城堡不能直接攻克,要攻克这些城堡必须先攻克其他某一个特定的城堡。你原创 2016-08-18 09:58:04 · 290 阅读 · 0 评论 -
【分组背包变形】HDU3033-I love sneakers!
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3033Problem DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers,原创 2016-08-17 23:34:33 · 417 阅读 · 0 评论 -
【数位DP】HDU3565-Bi-peak Number
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3565Problem DescriptionA peak number is defined as continuous digits {D0, D1 … Dn-1} (D0 > 0 and n >= 3), which exist Dm (0 Di+1 (m A原创 2016-08-27 21:05:12 · 594 阅读 · 0 评论 -
【数位DP】HDU3555-Bomb
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=3555题目基本同HDU2089,不过要注意,这里是long long 型Problem DescriptionThe counter-terrorists found a time bomb in the dust. But this time the terrori原创 2016-08-27 16:17:19 · 470 阅读 · 0 评论 -
【数位DP】HDU2089-不要62
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=2089Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。不原创 2016-08-27 12:16:28 · 388 阅读 · 0 评论 -
【递推DP】HDU1865-1sting
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1865Problem DescriptionYou will be given a string which only contains ‘1’; You can merge two adjacent ‘1’ to be ‘2’, or leave the ‘1’ the原创 2016-08-17 15:36:17 · 264 阅读 · 0 评论 -
【树形DP】HDU1520-Anniversary party
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1520Problem DescriptionThere is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a原创 2016-08-17 15:06:55 · 213 阅读 · 0 评论 -
【树形dp】HDU1011-Starship Troopers
题目链接:http://acm.split.hdu.edu.cn/showproblem.php?pid=1011(G20好强大,杭电都不让进。。。)Problem DescriptionYou, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is buil原创 2016-08-17 15:04:48 · 259 阅读 · 0 评论 -
【完全背包/母函数】HDU1284钱币兑换问题
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1284Problem Description在一个国家仅有1分,2分,3分硬币,将钱N兑换成硬币有很多种兑法。请你编程序计算出共有多少种兑法。 Input每行只有一个正整数N,N小于32768。 Output对应每个输入,输出兑原创 2016-04-07 14:24:11 · 385 阅读 · 0 评论 -
【01背包】HDU1203-I NEED A OFFER!
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1203Problem DescriptionSpeakless很早就想出国,现在他已经考完了所有需要的考试,准备了所有要准备的材料,于是,便需要去申请学校了。要申请国外的任何大学,你都要交纳一定的申请费用,这可是很惊人的。Speakless没有多少钱,总共只攒了n万美元。他将原创 2016-08-15 10:56:09 · 293 阅读 · 0 评论 -
【洛谷】P1164 小A点菜【动规】
题目链接:https://www.luogu.org/problemnew/show/P1164题目:题目背景uim神犇拿到了uoi的ra(镭牌)后,立刻拉着基友小A到了一家……餐馆,很低端的那种。uim指着墙上的价目表(太低级了没有菜单),说:“随便点”。题目描述不过uim由于买了一些辅(e)辅(ro)书,口袋里只剩M元(M餐馆原创 2017-12-17 13:43:23 · 253 阅读 · 0 评论 -
【动态规划】HDU1244Max Sum Plus Plus Plus
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1244这个题目要注意,n个数都是正整数。注意如果多一个段,状态怎么转移#includeusing namespace std;const int N=1050;const int INF=1<<29;int a[N],b[N],sum[N];int dp[N][N];void ini原创 2017-08-31 14:56:44 · 430 阅读 · 0 评论 -
【动态规划】HDU1422重温世界杯【最大子段和变形】
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1422#include#define LL long longusing namespace std;const int N=500005;LL a[N];int main(){ LL n,x,y; cin.sync_with_stdio(false); whil原创 2017-09-07 00:03:59 · 450 阅读 · 0 评论 -
【动态规划】HDU1081To The Max
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1081/* 将维度合成一列*/#includeusing namespace std;const int N=1050;int dp[N][N]; // dp[i][j]表示从dp[1][j]~dp[i][j]的和int a[N][N];int t[N];int ss,原创 2017-09-06 17:32:37 · 316 阅读 · 0 评论 -
【动态规划】HDU1559最大子矩阵
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1559/* 指定大小的最大子矩阵和 遍历每一个指定大小的矩阵*/#includeusing namespace std;const int N=1050;const int M=1050;int dp[N][M]={0}; // 从1,1到i,j的矩阵和int m原创 2017-09-06 16:17:29 · 327 阅读 · 0 评论 -
【贪心/01背包】HDU1735字数统计
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1735#includeusing namespace std;const int N=10050;const int M=25;const int L=105;int a[N][L];int dp[M];int n,m,l;int ans=0;void init(){ a原创 2017-08-27 15:14:58 · 260 阅读 · 0 评论 -
【DP】递推【91. Decode Ways】
题目链接:https://leetcode.com/problems/decode-ways/#/descriptionclass Solution {public: int numDecodings(string s) { int len=s.size(); if(len==0||s[0]=='0') return 0; vector原创 2017-07-23 16:34:59 · 281 阅读 · 0 评论 -
DP入门题目
基本思想:将待求解的问题分解成若干个相互联系的子问题,先求解子问题,然后从这些子问题的解得到原问题的解;对于重复出现的子问题,只在第一次遇到的时候对它进行求解,并把答案保存起来,让以后再次遇到时直接引用答案,不必重新求解。 课堂题目:1、斐波那契数列题目描述:http://acm.hdu.edu.cn/showproblem.php?pid=2041 有一楼原创 2017-07-19 13:36:23 · 423 阅读 · 0 评论 -
【DP】简单【121. Best Time to Buy and Sell Stock】【303. Range Sum Query - Immutable】
题目链接:https://leetcode.com/problems/best-time-to-buy-and-sell-stock/#/descriptionclass Solution {public: int maxProfit(vector& prices) { int len=prices.size(); if(len==0) return原创 2017-07-15 12:03:09 · 260 阅读 · 0 评论 -
【DP】最长回文字串【516. Longest Palindromic Subsequence】
题目链接:https://leetcode.com/problems/longest-palindromic-subsequence/#/descriptionclass Solution {public: int longestPalindromeSubseq(string s) { int len=s.size(); // 创建一个二维数组,指定原创 2017-07-22 10:38:06 · 213 阅读 · 0 评论 -
【DP】博弈【486. Predict the Winner】
题目链接:https://leetcode.com/problems/predict-the-winner/#/descriptionclass Solution {public: bool PredictTheWinner(vector& nums) { int len=nums.size(); int sum=0; for(int原创 2017-07-16 10:12:53 · 275 阅读 · 0 评论 -
【DP】添加n个数+-,统计和为S的方案数【494. Target Sum】
题目链接:https://leetcode.com/problems/target-sum/#/descriptionclass Solution {public: int findTargetSumWays(vector& nums, int S) { int dp[2001]={0}; dp[1000+nums[0]]=1; dp[原创 2017-07-16 10:12:29 · 443 阅读 · 0 评论 -
【数位DP】【357. Count Numbers with Unique Digits】
题目链接:https://leetcode.com/problems/count-numbers-with-unique-digits/#/descriptionclass Solution {public: int bit[15]={0}; // 保存最大值,999999... int dp[15]={0}; // 符合要求的方案数 int a[1原创 2017-07-15 12:01:07 · 262 阅读 · 0 评论 -
【01背包/母函数】HDU2079选课时间(题目已修改,注意读题)【用背包求解方案数】
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2079Problem Description又到了选课的时间了,xhd看着选课表发呆,为了想让下一学期好过点,他想知道学n个学分共有多少组合。你来帮帮他吧。(xhd认为一样学分的课没区别) Input输入数据的第一行是一个数据T,表示有T组数据。每原创 2016-04-19 15:03:16 · 446 阅读 · 0 评论 -
【01背包】HDU1881-毕业bg
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1881Problem Description每年毕业的季节都会有大量毕业生发起狂欢,好朋友们相约吃散伙饭,网络上称为“bg”。参加不同团体的bg会有不同的感觉,我们可以用一个非负整数为每个bg定义一个“快乐度”。现给定一个bg列表,上面列出每个bg的快乐度、持续长度、bg发起人的离校原创 2016-08-15 12:15:41 · 267 阅读 · 0 评论 -
【二维费用之完全背包】HDU3127-WHUgirls
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3127Problem DescriptionThere are many pretty girls in Wuhan University, and as we know, every girl loves pretty clothes, so do they. One day some of t原创 2016-08-15 23:51:02 · 319 阅读 · 0 评论 -
【01背包方案数】HDU2126-Buy the souvenirs
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2126Problem DescriptionWhen the winter holiday comes, a lot of people will have a trip. Generally, there are a lot of souvenirs to sell, and so原创 2016-08-15 19:41:48 · 345 阅读 · 0 评论 -
【递推公式】HDU1143Tri Tiling
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1143Problem DescriptionIn how many ways can you tile a 3xn rectangle with 2x1 dominoes? Here is a sample tiling of a 3x12 rectangle.原创 2016-03-23 21:47:22 · 358 阅读 · 0 评论 -
【01背包】HDU1171Big Event in HDU
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1171Problem DescriptionNowadays, we all know that Computer College is the biggest department in HDU. But, maybe you don't know that Computer Co原创 2016-04-16 11:18:31 · 264 阅读 · 0 评论 -
【01背包】HDU5656CA Loves GCD
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5656Problem DescriptionCA is a fine comrade who loves the party and people; inevitably she loves GCD (greatest common divisor) too. Now, ther原创 2016-04-10 16:25:38 · 478 阅读 · 0 评论 -
【分组背包】HDU1712ACboy needs your help
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1712Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from diff原创 2016-04-09 16:22:19 · 501 阅读 · 0 评论 -
【二维费用背包】HDU3496Watch The Movie
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3496Problem DescriptionNew semester is coming, and DuoDuo has to go to school tomorrow. She decides to have fun tonight and will be very bu原创 2016-04-09 12:31:53 · 362 阅读 · 0 评论