无约束最大子序列求和改进算法

给出了无约束最大子序列求和的一种改进算法,在不增加复杂性的前提下,突破了美国Mark A llen W eiss教授在约束条件下对该问题求解的算法,即该算法不能计算所有整数为负数情况下的最大子序列和(否则,结果视为0),从而解决了针对所有整数的无条件约束最大子序列的求和问题.

Research into unconstrained maximum subsequence summation algorithm

This article gives an advanced algorithm in summation for unconstrained maximum subsequence,without adding the complicacy of algorithm,which breaks an algorithm which was designed without constraint by an American professor named Mark Allen Weiss,namely when all of the integer are negative,the algorithm of Mark Allen Weiss can't compute the summation of maximum subsequence(otherwise,the summation is zero),however,accordingly,can compute the summation of maximum subsequence for any integer.