附上原文链接:https://www.cnblogs.com/clairvoyant/p/4944737.html 方便自己日后查找
思路:
以元素i结尾序列提供的最大正数记做 pos, 最小负数记做 naga[n] 大于零时:
pos[n] = max{pos[n-1] * a[n], a[n]}
max_value = max{max_value, pos[n]}
若n-1位置存在最小负数, 更新 nag[n] = nag[n-1] * a[n]
a[n] 小于零时:
pos[n] = max{nag[n-1] * a[n], 0.0}
max_value = max{max_value, pos[n]}
更新 nag[n] = min{pos[n-1] * a[n], a[n]}
a[n] 等于零时:
清空 nag[n] 与 pos[n]
public static double MaxSubsequenceProduct(double [] a, int len){
double Max = 0, pos = 0, old = 0, nag = 1;
for(int i = 0; i < len; i++){
if(a[i] > 1e-6){ // 大于 0
pos = Math.max(old * a[i], a[i]);
Max = Math.max(Max, pos);
if(nag < -1e-6){
nag = Math.min(nag, nag * a[i]);
}
}else if(a[i] < -1e-6){ // 小于 0
pos = Math.max(0.0, nag * a[i]);
Max = Math.max(Max, pos);
nag = (old * a[i] > a[i]) ? a[i] : old * a[i];
}else{ //等于 0
nag = 1.0;
pos = 0.0;
}
}
return Max;
}