Problem Detail - PA2012 Tanie linie

ID: 2033

Type: RemoteJudge

1000ms

256MiB

Difficulty: (None)

Uploaded By:

No submission language available for this problem.

题目描述

n个数字，求不相交的总和最大的最多k个连续子序列。
1<= k<= N<= 1000000。

5 2 7 -3 4 -9 5