最大长方形

最大长方形

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 2

描述

A histogram is a polygon composed of a sequence of rectangles aligned at a common base line. The rectangles have equal widths but may have different heights. For example, the figure on the left shows the histogram that consists of rectangles with the heights 2, 1, 4, 5, 1, 3, 3, measured in units where 1 is the width of the rectangles:

Usually, histograms are used to represent discrete distributions, e.g., the frequencies of characters in texts. Note that the order of the rectangles, i.e., their heights, is important. Calculate the area of the largest rectangle in a histogram that is aligned at the common base line, too. The figure on the right shows the largest aligned rectangle for the depicted histogram.

输入

The input contains several test cases. Each test case describes a histogram and starts with an integer n, denoting the number of rectangles it is composed of. You may assume that 1 <= n <= 100. Then follow n integers h1, ..., hn, where 0 <= hi <= 100000. These numbers denote the heights of the rectangles of the histogram in left-to-right order. The width of each rectangle is 1. A zero follows the input for the last test case.

输出

For each test case output on a single line the area of the largest rectangle in the specified histogram. Remember that this rectangle must be aligned at the common base line.

样例输入

7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0

样例输出

8
4000

从这道题中我可以学到很多东西。原先不懂得暴力枚举，从这道题我是学会了。

它是隶属于动归里面的题型。但是对于初学的我来说还没有能力去把它写出来。

int n;
  while(~scanf("%d",&n))
  {
      if(n==0)
        break;
      int a[105];
      for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
        int ma=a[1];
      for(int i=1;i<=n-1;i++)
      {
          int mi=a[i],s;
          for(int j=i+1;j<=n;j++)
          {
               if(mi>a[j])
                mi=a[j];
               s=mi*(j+1-i);
               if(ma<s)
                ma=s;
          }
      }
      printf("%d\n",ma);
  }