哈理工OJ-2326-Blind Father

HRBUST - 2326
Mr. Leng, who is the predominately inheritor of buried-love family (One of the most vogue families during your primary school maybe, anyway, this is unimportant), has such cool, cooler and coolest temperament. But, only a good ACMer can be the real leader, in other words, be admitted as a successor.
One day, a problem come to Mr. Leng 's father about carpentry. There are N pieces of planks upright the ground in one line. Each one width 1 and height uncertain. His father wants to cut some of them and then get a rectangle. How the biggest rectangle does him can make? It too difficult to his father to solve the problem, but it is really easy for Mr. Leng. So do you. Please surmount the problem as soon as you can.
Ps: You can’t move or change the posture or position of any planks.
Input
There are multiple cases. In each cases, the first line only contains an integer N,
means the number of the planks. And the second line contains N numbers, means the height of N planks one by one.
1<=N<=10000
Output
Please output the biggest rectangle that Mr. Leng 's father can get.
Sample Input
3
10 6 10
Sample Output
18
Hint
样例图形

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n;

    while(~scanf("%d",&n))
    {int a[n];
        for(int i=0;i<n;i++)
        {
            scanf("%d",&a[i]);
        }
        int ans=-1;
        for(int i=0;i<n;i++)
        {
            int L=i;
            int R=i;
            for(int j=i;j>=0;j--)
            {
                if(a[j]>=a[i])
                    L=j;
                else
                    break;
            }
            for(int j=i;j<n;j++)
            {
                if(a[j]>=a[i])
                    R=j;
                else
                    break;
            }
            ans=max(ans,(R-L+1)*a[i]);
        }
        printf("%d\n",ans);
    }
    return 0;
}