HDU 3280 Equal Sum Partitions（区间DP）【模板】

最新推荐文章于 2019-08-03 13:19:09 发布

wust_zwl

最新推荐文章于 2019-08-03 13:19:09 发布

阅读量354

点赞数 1

分类专栏： -----模板题型----- ACM__区间DP 文章标签： dp 动态规划

本文链接：https://blog.csdn.net/qq_38538733/article/details/76788272

版权

这篇博客详细解析了如何使用动态规划（DP）来解决HDU 3280 Equal Sum Partitions问题，重点介绍了区间DP模板的应用，帮助读者理解和掌握这种问题的求解策略。

摘要由CSDN通过智能技术生成

An equal sum partition of a sequence of numbers is a grouping of the numbers (in the same order as the original sequence) in such a way that each group has the same sum. For example, the sequence:
2 5 1 3 3 7
may be grouped as:
(2 5) (1 3 3) (7)
to yield an equal sum of 7.

Note: The partition that puts all the numbers in a single group is an equal sum partition with the sum equal to the sum of all the numbers in the sequence.

For this problem, you will write a program that takes as input a sequence of positive integers and returns the smallest sum for an equal sum partition of the sequence.

Input

The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the nu