动态规划
文章平均质量分 81
angel_e
这个作者很懒,什么都没留下…
展开
-
动态规划--模板--hdu 1059 Dividing
DividingTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 14861 Accepted Submission(s): 4140Problem DescriptionMarsha and Bill原创 2014-03-27 14:32:43 · 467 阅读 · 0 评论 -
hdu 2196 Computer 树形dp模板题
ComputerTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2850 Accepted Submission(s): 1450Problem DescriptionA school bought t转载 2014-04-29 16:15:52 · 582 阅读 · 0 评论 -
树形dp--hdu 3534 Tree
TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 906 Accepted Submission(s): 268Problem DescriptionIn the Data structure c转载 2014-05-03 16:23:08 · 753 阅读 · 0 评论 -
hdu 4607 Park Visit 求树的直径
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4607题目大意:给你n个点,n-1条边,将图连成一棵生成树,问你从任意点为起点,走k(k思路:树形dp求树的直径r; a:若k b:若k>=r+1,ans = r+(k-(r+1))*2;#include "stdi原创 2014-05-06 11:09:28 · 890 阅读 · 0 评论 -
nyoj 546
Divideing Jewels时间限制:1000 ms | 内存限制:65535 KB难度:4描述Mary and Rose own a collection of jewells. They want to split the collection among themselves so that both receive an equal share of the j原创 2014-05-19 10:23:49 · 511 阅读 · 0 评论 -
nyoj 715 Adjacent Bit Counts --DP
Adjacent Bit Counts时间限制: 1 Sec 内存限制: 128 MB题目描述For a string of n bits x1, x2, x3, …, xn, the adjacent bit count of the string is given by fun(x) = x1*x2 + x2*x3 + x3*x 4 + … + xn-原创 2014-05-19 20:02:08 · 636 阅读 · 0 评论 -
hdu 2089 不要62--数位dp入门
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 17817 Accepted Submission(s): 5893Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:原创 2014-05-20 16:27:15 · 479 阅读 · 0 评论 -
poj 2342 Anniversary party 简单树形dp
Anniversary partyTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3862 Accepted: 2171DescriptionThere is going to be a party to celebrate the 80-th Ann转载 2014-04-29 09:09:30 · 461 阅读 · 0 评论