uva 11059 maximum product（水题）——yhx

1 #include<cstdio>
2 int a[20];
3 int main()
4 {
5     int i,j,k,m,n,p,t,q,y,z;
6     long long ans,x;
7     t=0;
8     while (scanf("%d",&n)==1)
9     {
10         ans=0;
11         for (i=1;i<=n;i++)
12           scanf("%d",&a[i]);
13         for (i=1;i<=n;i++)
14           for (j=i;j<=n;j++)
15           {
16               x=1;
17               for (k=i;k<=j;k++)
18                 x*=a[k];
19               if (x>ans) ans=x;
20           }
21         printf("Case #%d: The maximum product is %lld.\n\n",++t,ans);
22     }
23 }