Maximum product
题目大意
找出数组中的最大乘积,如果找不到一个正数结果,输出0.
题目分析
遍历每一种情况,如果大于max就将其替换。
注意每一个case后要空行,否则会PE
代码
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string>
using namespace std;
int main()
{
int t,n,k=0;
long long pro=1,flag,max;
int a[101];
while(scanf("%d",&n)!=EOF)
{
flag=0;
max=0;
pro=1;
k++;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++)
{
pro=1;
for(int j=i;j<n;j++)
{
pro=pro*a[j];
if(pro>max)
max=pro;
}
}
if(max>0)
cout<<"Case"<<" "<<"#"<<k<<":"<<" "<<"The maximum product is "<<max<<"."<<endl;
else
cout<<"Case"<<" "<<"#"<<k<<":"<<" "<<"The maximum product is "<<0<<"."<<endl;
cout<<endl;
}
return 0;
}