CCF(Java)系列之最大矩形(_20131203)

转载自：https://blog.csdn.net/john_bian/article/details/77987590
package com.example.administrator.test.ccf;
import java.util.Scanner;

/**
 * @author kyp
 * @time 2019/7/8
 * @description 最大矩形 时间n*n
 */
public class _20131203 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int max = 0;
        if (n < 1 || n > 1000) {
            return;
        }
        int[] num = new int[n];
        for (int i = 0; i < n; i++) {
            num[i] = scanner.nextInt();
        }
        //找到区域内最小的高
        for (int i = 0; i < n; i++) {
            int wide=1;
            for (int j = i + 1; j < n; j++) {
                if (num[j] >= num[i]) {
                    wide++;
                } else {
                    break;
                }
            }

            for (int j = i - 1; j >= 0; j--) {
                if (num[j] >= num[i]) {
                    wide++;
                } else {
                    break;
                }
            }

            max = Math.max(max, wide * num[i]);
        }
        System.out.println(max);

    }
}