求最大连续子序列乘积

// 求最大连续子序列乘积.cpp : 定义控制台应用程序的入口点。
//****************************动态规划方法********************************

#include "stdafx.h"

#include <iostream>
#include <algorithm>

int max(int x, int y, int z)
{
int temp = x>y?x:y;

return temp>z?temp:z;
}

int min(int x, int y, int z)
{
int temp = x<y?x:y;

return temp<z?temp:z;
}

void longestMultiple(int *a, int n)
{
int *Min = new int
();
int *Max = new int
();

Max[0] = Min[0] = a[0];

int maxVal = Max[0];
for(int i=1; i<n; i++)
{
//状态转移方程
Max[i] = max(Max[i-1]*a[i],Min[i-1]*a[i],a[i]);
Min[i] = min(Max[i-1]*a[i],Min[i-1]*a[i],a[i]);

if(maxVal<Max[i])
maxVal=Max[i];
}

if(maxVal<0)
printf("%d",-1);
else
printf("%d",maxVal);

delete [] Max;
delete [] Min;
}

int main()
{
int a[10] = {-2, -3, -4};

longestMultiple(a, 4);

return 0;
}