摘要： 最大子序列求和问题算法一#include int maxsubsequence(const int a[], int size) { int maxsum = 0, i = 0, j, thissum, first, last; for (; i maxsum) { ... 阅读全文