![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
算法
文章平均质量分 86
xflow-
hello world
展开
-
动态规划 --- hdu 1003 **
Max SumTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 121563 Accepted Submission(s): 28137Problem DescriptionGiven a sequenc原创 2013-11-30 16:12:45 · 563 阅读 · 0 评论 -
动态规划(状态压缩dp) --- HDU 1074 **
Doing HomeworkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4416 Accepted Submission(s): 1787Problem DescriptionIgnatius原创 2013-12-05 16:52:40 · 548 阅读 · 0 评论 -
动态规划 --- hdu 1176 **
免费馅饼Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21111 Accepted Submission(s): 7112Problem Description都说天上不会掉馅饼,但有一天gamebo原创 2013-12-03 21:28:53 · 434 阅读 · 0 评论 -
整数分解(递归)
题目大意:给定一个整数n,找到k个数,使得其和等于n。解题思路:要分解整数n,肯定先要找到一个因子,然后我们会发现,剩下的问题还是一个整数分解问题,因此容易得到问题的解。定义函数f(n)为n可以分解的解的个数,即可以先分解出一个数字k(k = 0,1,2,……,n),然后再分解f(k),可以得出有:f(n) = f(n-1) + f(n-2) + ……+ f(1) + f(0),其原创 2014-03-19 23:50:24 · 6159 阅读 · 1 评论