POJ 2082 Terrible Sets(栈)

Terrible Sets

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 4348		Accepted: 2248

Description

Let N be the set of all natural numbers {0 , 1 , 2 , . . . }, and R be the set of all real numbers. wi, hi for i = 1 . . . n are some elements in N, and w0 = 0. 
Define set B = {< x, y > | x, y ∈ R and there exists an index i > 0 such that 0 <= y <= hi ,∑_0<=j<=i-1wj <= x <= ∑_0<=j<=iwj} 
Again, define set S = {A| A = WH for some W , H ∈ R⁺ and there exists x0, y0 in N such that the set T = { < x , y > | x, y ∈ R and x0 <= x <= x0 +W and y0 <= y <= y0 + H} is contained in set B}. 
Your mission now. What is Max(S)? 
Wow, it looks like a terrible problem. Problems that appear to be terrible are sometimes actually easy. 
But for this one, believe me, it's difficult.

Input

The input consists of several test cases. For each case, n is given in a single line, and then followed by n lines, each containing wi and hi separated by a single space. The last line of the input is an single integer -1, indicating the end of input. You may assume that 1 <= n <= 50000 and w₁h₁+w₂h₂+...+w_nh_n < 10⁹.

Output

Simply output Max(S) in a single line for each case.

Sample Input

3
1 2
3 4
1 2
3
3 4
1 2
3 4
-1

Sample Output

12
14

题意：有一排靠在一起的矩形，给出它们的高和宽，问它们形成的最大矩形的面积是多少？

题解：将矩形入栈，要保持从栈底到栈顶矩形的高度递增，要入栈矩形高度小于栈顶矩形高度时，就将栈顶矩形出栈。并在出栈过程中记录下出栈矩形能组成的最大矩形面积。然后将出栈矩形与要入栈矩形合并，高度为入栈矩形高度。   所有矩形入栈操作结束后，这时栈内的矩形一定高度递增，最后扫面一遍栈内矩形，记录下最大矩形面积即可。

光看文字题解，可能不是很直观，不容易理解。贴一篇本校师兄的题解，有图片，很清晰：点击打开链接  

代码如下：

#include<cstdio>
#include<cstring>
#include<stack>
#include<algorithm>
using namespace std;
struct node
{
	int w,h;
}data; 

int main()
{
	int n,i;
	while(scanf("%d",&n)&&(n!=-1))
	{
		stack<node>s;
		int ans=0,width,area,lasth=0;
		for(i=0;i<n;++i)
		{
			scanf("%d%d",&data.w,&data.h);
			if(data.h>=lasth)//如果当前矩形高度比栈顶矩形高，直接入栈 
				s.push(data);
			else//否则栈顶矩形出栈，直到栈顶矩形高度小于要入栈的矩形高度停止 
			{
				width=0;
				while(!s.empty()&&s.top().h>data.h)//记录出栈的矩形中能找到的最大矩形的面积 
				{
					width+=s.top().w;
					area=width * s.top().h;
					if(area>ans)
						ans=area;
					s.pop();
				}
				width+=data.w;//将所有出栈矩形和要入栈的矩形合并起来，取要入栈矩形的高度 
				data.w=width;
				s.push(data);
			}
			lasth=data.h;
		}
		width=0;
		while(!s.empty())//最后将栈中的所有矩形扫描一遍 
		{
			width+=s.top().w;
			area=width * s.top().h;
			if(area>ans)
				ans=area;
			s.pop();
		}
		printf("%d\n",ans);
	}
	return 0; 
}