当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3977:Subset

题目描述
Given a list of N integers with absolute values no larger than 1015, find a non empty subset of these numbers which minimizes the absolute value of the sum of its elements. In case there are multiple subsets, choose the one with fewer elements.
输入解释
The input contains multiple data sets, the first line of each data set contains N <= 35, the number of elements, the next line contains N numbers no larger than 1015 in absolute value and separated by a single space. The input is terminated with N = 0
输出解释
For each data set in the input print two integers, the minimum absolute sum and the number of elements in the optimal subset.
输入样例
1
10
3
20 100 -100
0
输出样例
10 1
0 2

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-3977

最后修改于 2020-10-29T07:17:15+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
30000 65536