# POJ 2082 Terrible Sets（可怕的矩形）

Terrible Sets
 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 4812 Accepted: 2465

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 w1h1+w2h2+...+wnhn < 109.

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

Source

AC CODE：

#include<cstdio>
#include<stack>
using namespace std;

struct rec {
int w;
int h;
} data;

int main()
{
int n, ans, i, lasth, totalw, curarea;
while(scanf("%d", &n) && n != -1) {
ans = 0;
stack<rec> s;
lasth = 0;//上次进栈的矩形高度

for(i = 0; i < n; i++) {
scanf("%d%d", &data.w, &data.h);
if(data.h >= lasth) {
s.push(data);
} else {//当前进栈的矩形高度较小
totalw = 0;//总宽
curarea = 0;//当前面积
while(!s.empty() && s.top().h > data.h) {
totalw += s.top().w;
curarea = totalw * s.top().h;
if(curarea > ans) ans = curarea;
s.pop();
}
totalw += data.w;
data.w = totalw;
s.push(data);//新的矩形
}
lasth = data.h;
}

totalw = 0;
curarea = 0;//当前面积
while(!s.empty()) {
totalw += s.top().w;
curarea = totalw * s.top().h;
if(curarea > ans) ans = curarea;
s.pop();
}

printf("%d\n", ans);
}
return 0;
}

/*
4
1 3
2 3
3 3
4 3
30

4
3 4
3 3
3 2
3 1
18
*/


07-21 256

04-15 282

07-30 308

04-30 81

09-13 150

04-17 50

08-14 121

08-23 856

09-01 213

#### Terrible Sets

©️2020 CSDN 皮肤主题: 大白 设计师: CSDN官方博客

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、C币套餐、付费专栏及课程。