动态规划
文章平均质量分 71
luer9
假如我年少有为。
展开
-
HDU 1003-Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4...原创 2018-06-02 14:21:47 · 188 阅读 · 0 评论 -
POJ 1417 True Liars (带权并查集,dp)
True LiarsTime Limit:1000MS Memory Limit:10000K Total Submissions:7080 Accepted:2302 DescriptionAfter having drifted about in a small boat for a couple of days, Akira Cruso...原创 2019-08-19 11:04:52 · 191 阅读 · 0 评论 -
HDU 1024 Max Sum Plus Plus(动态规划+m子段和的最大值)
Max Sum Plus PlusTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 39787Accepted Submission(s): 14307Problem DescriptionNow I think y...原创 2019-01-30 18:29:20 · 233 阅读 · 1 评论 -
哈尔滨理工大学软件与微电子学院第八届程序设计竞赛同步赛(高年级)E 小乐乐匹配字符串
链接:https://ac.nowcoder.com/acm/contest/301/E来源:牛客网 题目描述小乐乐有字符串str1,str2。小乐乐想要给他们找朋友。小乐乐想知道在这两个字符串中最多能匹配出多长的相同子串(可非连续)。输入描述:第一行输入字符串str1;第二行输入字符串str2;数据保证字符串长度小于1000,且非空,字符串仅由小写字母组成。...原创 2018-12-04 23:31:05 · 210 阅读 · 0 评论 -
HDU 2089 不要62 (数位DP)
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 58000 Accepted Submission(s): 22769Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。...原创 2018-09-12 13:23:59 · 118 阅读 · 0 评论 -
POJ - 3280 Cheapest Palindrome
Cheapest PalindromeKeeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will re...转载 2018-07-20 17:45:39 · 96 阅读 · 0 评论 -
牛客网暑期ACM多校训练营(第二场)_A run
链接:https://www.nowcoder.com/acm/contest/140/A来源:牛客网 题目描述White Cloud is exercising in the playground.White Cloud can walk 1 meters or run k meters per second.Since White Cloud is tired,it can't...原创 2018-07-24 10:37:02 · 235 阅读 · 0 评论 -
POJ - 1088 滑雪
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 106118 Accepted: 40396DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维...转载 2018-07-12 13:22:13 · 125 阅读 · 0 评论 -
POJ - 1742 Coins
CoinsTime Limit: 3000MS Memory Limit: 30000K Total Submissions: 42608 Accepted: 14398 DescriptionPeople in Silverland use coins.They have coins of value A1,A2,A3...An Silverlan...原创 2018-07-17 17:24:48 · 107 阅读 · 0 评论 -
POJ - 2229 Sumsets
SumsetsTime Limit: 2000MS Memory Limit: 200000K Total Submissions: 23002 Accepted: 8810 DescriptionFarmer John commanded his cows to search for different sets of numbers that s...原创 2018-07-17 11:21:04 · 182 阅读 · 0 评论 -
POJ - 3176 Cow Bowling
Cow BowlingTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 22189 Accepted: 14621 DescriptionThe cows don't use actual bowling balls when they go bowling. They each t...原创 2018-07-17 09:04:52 · 101 阅读 · 0 评论 -
POJ - 2385 Apple Catching
Apple CatchingTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 14877 Accepted: 7279 DescriptionIt is a little known fact that cows love apples. Farmer John has two ap...原创 2018-07-17 09:00:21 · 149 阅读 · 0 评论 -
POJ - 3616 Milking Time
Milking TimeTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 13310 Accepted: 5614 DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizi...原创 2018-07-17 08:58:59 · 141 阅读 · 0 评论 -
01背包,完全背包,多重背包
好像从没有系统的整理过……【01背包】给你n种不同的物品,每个物品有自己的重量w[i],和价值v[i],如果每个物品只能拿一次,给你容量为m的背包,怎样才能取得最大价值?memset(dp, 0, sizeof(dp));for(int i=0; i<n; i++){ for(int j=m; j>=w[i]; j--){ dp[j] = max(dp[...原创 2019-08-19 14:28:38 · 103 阅读 · 0 评论