|
| 摘要: |
| 给出了无约束最大子序列求和的一种改进算法,在不增加复杂性的前提下,突破了美国Mark A llen W eiss教授在约束条件下对该问题求解的算法,即该算法不能计算所有整数为负数情况下的最大子序列和(否则,结果视为0),从而解决了针对所有整数的无条件约束最大子序列的求和问题. |
| 关键词: 约束序列 无约束序列 最大子序列 改进算法 |
| DOI： |
| 分类号:O224 |
| 基金项目: |
|
| Research into unconstrained maximum subsequence summation algorithm |
|
ZENG Bo LONG Qian
|
| Abstract: |
| 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 w |
| Key words: constrained sequence,unconstrained sequence,maximum sequence,modified algorithm |
