请教几个算法题, 第一个# CS - 计算机科学
t*s
1 楼
2n integers
divide them into two groups of size n
sum of both groups have to be nonnegative
if impossible, output impossible
这个动态规划么？
divide them into two groups of size n
sum of both groups have to be nonnegative
if impossible, output impossible
这个动态规划么？