数据结构 Maximum Subsequence Sum
7-2 Maximum Subsequence Sum (25分)
Given a sequence of K integers { N
1
, N
2
, …, N
K
}. A continuous subsequence is defined to be { N
i
, N
i+1
, …, N
j
} where 1≤i≤j≤K. The Maximum Subsequence is the continuous subsequence which
原创
2021-01-29 20:34:02 ·
138 阅读 ·
0 评论