一个int数组，求乘起来最大的连续子序列

一道题目，和朋友分析了半天，只有以下的一些结论：

1. 如果是正数的话，就全部乘起来就可以了

2. 如果是偶数个的负数的话，就直接全部乘起来就可以了。

3. 单数个负数的话是挺复杂的。。。

以下是网上抄来的算法，写得挺好，但是还没看懂，据说用的是DP，而且是经典的DP问题。看来经典的一定要搞懂才行啊

static void Main(string[] args) { int [] arr = new int []{1,2,-2,3,4,5,6,7,8,-3,9,0,1}; int beginIndex = 0; int endIndex = 0; long max = Program.MaxSubMul(arr, out beginIndex, out endIndex); Console.WriteLine(string.Format("BeginIndex {0} EndIndex {1} Max {2}", beginIndex, endIndex, max)); Console.Read(); } /// <summary> /// 求解最大子段积，返回结果以及最优解的始末下标 /// </summary> /// <param name="seq">输入序列</param> /// <param name="beginIndex">返回最优解的起始下标</param> /// <param name="endIndex">返回最优解的结束下标</param> /// <returns>最大子段积</returns> public static long MaxSubMul(int[] seq, out int beginIndex, out int endIndex) { if (seq == null || seq.Length == 0) throw new ArgumentNullException("输入序列不能为空"); long maxMul = seq[0]; beginIndex = endIndex = 0; long curMaxMul = seq[0], curMinMul = seq[0]; int curMinBeginIndex = 0, curMaxBeginIndex = 0; for (int i = 1; i < seq.Length; i++) { long a = curMaxMul * seq[i], b = curMinMul * seq[i]; long max, min; int tmpMaxBeginIndex, tmpMinBeginIndex; if (a > b) { max = a; min = b; tmpMaxBeginIndex = curMaxBeginIndex; tmpMinBeginIndex = curMinBeginIndex; } else { max = b; min = a; tmpMaxBeginIndex = curMinBeginIndex; tmpMinBeginIndex = curMaxBeginIndex; } if (seq[i] > max) { curMaxBeginIndex = i; curMaxMul = seq[i]; } else { curMaxBeginIndex = tmpMaxBeginIndex; curMaxMul = max; } if (seq[i] < min) { curMinBeginIndex = i; curMinMul = seq[i]; } else { curMinBeginIndex = tmpMinBeginIndex; curMinMul = min; } if (curMaxMul > maxMul) { maxMul = curMaxMul; beginIndex = curMaxBeginIndex; endIndex = i; } } return maxMul; }