最大连续子序列乘积

#include <iostream>
#include <string.h>
using namespace std;
int maxn[2020];
int minn[2020];
int a[2020];
int min(int a,int b,int c)
{
int minn;
minn=a<b?a:b;
minn=minn<c?minn:c;
return minn;
}
int max(int a,int b,int c)
{
int maxn;
maxn=a>b?a:b;
maxn=maxn>c?maxn:c;
return maxn;
}
int main ()
{
int n,big=-9999;
cin>>n;
memset(a,0,sizeof(a));
memset(minn,0,sizeof(minn));
memset(maxn,0,sizeof(maxn));
for (int i=0;i<n;i++)
cin>>a[i];
minn[0]=maxn[0]=a[0];//i==0，min与max为其本身
for (int i=1;i<n;i++)
{
minn[i]=min(a[i],minn[i-1]*a[i],maxn[i-1]*a[i]);// 方程1
maxn[i]=max(a[i],minn[i-1]*a[i],maxn[i-1]*a[i]);//方程2
if (maxn[i]>big)
big=maxn[i];
}
cout<<big<<endl;
return 0;
}