最大相邻矩形面积

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <queue>
#include  <cmath>
#define ll long long

using namespace std;

int a[100000];

int main()
{
    int n;
    int x;
    int max = 0;
    cin >> n;
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    for(int i = 0; i < n; ++i)
    {
        x = 1;
        for(int j = i-1; j >=0; --j)
        {
            if(a[j] >= a[i])
                x++;
            else
                break;
        }
        for(int j = i+1; j <n; ++j)
        {
            if(a[j] >= a[i])
                x++;
            else
                break;
        }
        if(max < x*a[i])
            max = x*a[i];
    }
    cout << max;
    return 0;
}