Terrible Sets——poj-2082——单调栈

Language:Default Terrible Sets Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 5045 Accepted: 2583 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 1h 1+w 2h 2+…+w nh n < 10 9. 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 Shanghai 2004 Preliminary

题意：依次给定矩形的高和宽 求能形成的最大矩形的面积
服了出题人了 这么简单的题意非要搞这么复杂的描述
特别是最后一句话 分分钟吐血

思路：维护一个单调栈 高度变大就推进去 变小就把前面符合条件的弹出去

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#define max_ 100010
#define inf 0x3f3f3f3f
#define ll long long
using namespace std;
struct node
{
    int w,h;
}zz;
stack<struct node>s;
int main(int argc, char const *argv[])
{
    int n;
    while(scanf("%d",&n)!=EOF&&n!=-1)
    {
        int i,maxx=0;
        while(s.size())
            s.pop();
        while(n--)
        {
            scanf("%d%d",&zz.w,&zz.h);
            if(s.empty()||s.top().h<zz.h)
                s.push(zz);
            else
            {
                int sw=0;
                while(s.size()&&s.top().h>=zz.h)
                {
                    sw+=s.top().w;
                    maxx=max(maxx,sw*s.top().h);
                    s.pop();
                }
                zz.w+=sw;
                s.push(zz);
            }
        }
        int sw=0;
        while(!s.empty())
        {
            sw+=s.top().w;
            maxx=max(maxx,sw*s.top().h);
            s.pop();
        }
        printf("%d\n",maxx );
    }
    return 0;
}