#BZOJ3502. PA2012 Tanie linie
-
ID: 2033
Type: RemoteJudge
1000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
root
PA2012 Tanie linie
题目描述
n个数字，求不相交的总和最大的最多k个连续子序列。
1<= k<= N<= 1000000。
5 2 7 -3 4 -9 5
13