python/TangDou/LanQiaoBei/LanQiao14ShengSai/4_BruteForce.cpp

#include <bits/stdc++.h>
using namespace std;

const int N = 10000010;

int a[N];
int res;
/*
测试样例I
6
3 2 1 4 5 2

输出:
8

测试样例II
5
2 4 3 4 5

输出:
12
*/
int main() {
    int n;
    cin >> n;

    for (int i = 0; i < n; i++) cin >> a[i];

    for (int i = 0; i < n; i++) {
        int width = 1;
        for (int j = i - 1; j >= 0; j--) {
            if (a[j] < a[i]) break;
            width++;
        }

        for (int j = i + 1; j < n; j++) {
            if (a[j] < a[i]) break;
            width++;
        }
        res = max(res, width * a[i]);
    }
    cout << res << endl;
    return 0;
}