- 入门题,别忘清maxn和注释freopen。
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std;
long long n,a[20],maxn,nw,num;
int main()
{
// freopen("1.txt","w",stdout);
while(cin>>n)
{
maxn=0;
for(int i=1;i<=n;i++) cin>>a[i];
for(int i=1;i<=n;i++)
{
nw=a[i];
maxn=max(maxn,nw);
for(int j=i+1;j<=n;j++)
{
nw*=a[j];
maxn=max(maxn,nw);
}
}
cout<<"Case #"<<++num<<": The maximum product is "<<maxn<<'.'<<endl<<endl;
}
return 0;
}