POJ2576 Tug of War (二维的01背包)

最新推荐文章于 2024-07-25 23:55:01 发布

sunny1996

最新推荐文章于 2024-07-25 23:55:01 发布

阅读量1.2k

点赞数 1

分类专栏：算法与ACM 文章标签：动态规划 poj

本文链接：https://blog.csdn.net/sunny1996/article/details/44542573

版权

这篇博客详细介绍了如何解决POJ2576 Tug of War问题，该问题属于二维01背包问题的范畴。通过动态规划的方法，文章阐述了如何构建状态转移方程，以及如何从样例输入中得出正确输出，为读者提供了解题思路和步骤。

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

Description

A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of people on the two teams must not differ by more than 1; the total weight of the people on each team should be as nearly equal as possible.

Input

The first line of input contains n the number of people at the picnic. n lines follow. The first line gives the weight of person 1; the second the weight of person 2; and so on. Each weight is an integer between 1 and 450. There are at most 100 people at the picnic.

Output

Your output will be a single line containing 2 numbers: the total weight of the people on one team, and t