poj 2082 Terrible Sets【单调栈】

Terrible Sets

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 <algorithm>
#include <cmath>
#include <stack>
using namespace std;
typedef long long LL;

struct node {
	LL l, w;
}now;

int main() {
	LL n;
	while(scanf("%lld", &n), n != -1) {
		stack<node> s;
		LL ans = 0, temp;
		scanf("%lld %lld", &now.l, &now.w);
		s.push(now);
		for(int i = 0; i < n - 1; i++) {
			scanf("%lld %lld", &now.l, &now.w);
			temp = 0;
			if(now.w >= s.top().w) {
				s.push(now);
				continue;
			}
			while(!s.empty() && s.top().w > now.w) {
				temp += s.top().l;
				if(ans < temp * s.top().w) {
					ans = temp * s.top().w;
				}
				s.pop();
			}
			node next;
			next.l = temp + now.l;
			next.w = now.w;
			s.push(next);
		}
		temp = 0;
		while(!s.empty()) {
			temp += s.top().l;
			if(ans < temp * s.top().w) {
				ans = temp * s.top().w;
			}
			s.pop();
		}
		printf("%lld\n", ans);
	}
	return 0;
}