A - Largest Rectangle in a Histogram

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.

Input

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<=100000. Then follow n integers h1,...,hn, where 0<=hi<=1000000000. 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.

Output

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.

Sample

 Input

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

Output

8
4000

题意：有各种不同高度的矩形，求最大的连续子矩形。

思路：方法有很多，这里我用的是单调栈，举个栗子，5，5，6，7，5，5，6，用栈记录到第5个数时，要把前面比5大的数的下标（这里用栈记录下标会方便一点，因为数的下标是唯一的）pop出去，此时同时记录宽度更新最大值，而后面很可能有数会和前面的5连起来，但是前面比5大的数已经pop掉了，所以我们可以设置数组根据该数字的下标记录前面有几个连续的数比5大，这样就可以将前后联系起来计算了。

代码：

#include<iostream>
#include<stack>
#include<cstring>
using namespace std;
const int N=100007;
int main()
{
	int i,j;
	int n;
	long long maxx;
	scanf("%d",&n);
	while(n!=0){
		stack<int>s;
		maxx=0;
		int a[N],ans[N];
		memset(ans,0,sizeof(ans));
		memset(a,0,sizeof(a));
		for(i=1;i<=n;i++){
			scanf("%d",&a[i]);
		}
		a[++n]=0;
	   for(i=1;i<=n;i++){
	   	 int cnt=0;
	     while(!s.empty()&&a[s.top()]>a[i]){
		    int x=a[s.top()];
		    cnt+=ans[s.top()];
		    maxx=max(maxx,(long long)x*cnt);
		    s.pop();
	      }
	      s.push(i);
	      ans[i]=cnt+1;
       }
		printf("%lld\n",maxx);
		scanf("%d",&n);
	}
	return 0;
}