![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
zhengde152
这个作者很懒,什么都没留下…
展开
-
Super Jumping! Jumping! Jumping!
Super Jumping! Jumping! Jumping! Nowadays, a kind of chess game called “Super Jumping! Jumping! Jumping!” is very popular in HDU. Maybe you are a good boy, and know little about this game, so I in...原创 2018-08-27 13:10:04 · 127 阅读 · 0 评论 -
整数划分
整数划分 将N分为若干个不同整数的和,有多少种不同的划分方式,例如:n = 6,{6} {1,5} {2,4} {1,2,3},共4种。由于数据较大,输出Mod 10^9 + 7的结果即可。 Input 输入1个数N(1 <= N <= 50000)。 Output 输出划分的数量Mod 10^9 + 7。 Sample Input 6 Sample Output ...原创 2018-09-02 20:08:37 · 412 阅读 · 0 评论 -
Max Sum Plus Plus
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced with a more difficult problem. Given...原创 2018-12-11 21:42:38 · 152 阅读 · 0 评论