Uva 11059 Maximum Product

来源:互联网 发布:复用千兆sfp端口 编辑:程序博客网 时间:2024/06/10 03:14


分析:每个元素的绝对值不超过10且不超过18个元素,最大可能乘积不会超过10的18次。


import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int count = 0;while (scanner.hasNext()) {int n = scanner.nextInt();int[] a = new int[n];for (int i = 0; i < n; i++) {a[i] = scanner.nextInt();}long tmp = 1;long max = 0;for (int i = 0; i < n; i++) {if (a[i] == 0) {tmp = 1;continue;}tmp *= a[i];max = Math.max(max, tmp);}tmp = 1;for (int i = n - 1; i >= 0; i--) {if (a[i] == 0) {tmp = 1;continue;}tmp *= a[i];max = Math.max(max, tmp);}System.out.println("Case #"+ (++count) + ": The maximum product is "+ max + ".");System.out.println();}}}