摘要：
//求一个数列的最大子序列和#include #include int MaxSubsequenceSum(const std::vector& ivec){ int ThisSum = 0, MaxSum = 0; for(std::vector::const_iterator it = ivec.begin(); it != ivec.end(); ++it) { ThisSum += *it; if(ThisSum MaxSum) MaxSum = ThisSum; } ... 阅读全文