UVA11059 Maximum Product

暴力求解即可。

#include <stdio.h>int s[30];long long max;int main(){int n,index = 0;while(scanf("%d",&n) != EOF){int i,j;for(i = 0; i < n; i ++)scanf("%d",&s[i]);max = 0;long long mul;for(i = 0; i < n; i ++){mul = 1;for(j = i;  j < n; j ++){mul *= s[j];if(mul > max)max = mul;}}printf("Case #%d: The maximum product is %lld.\n\n",++index,max);}return 0;}