Largest Rectangle in a Histogram

题目链接：链接: NK—50965.
题目描述：
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 \leq n \leq 1000001≤n≤100000. Then follow n integers h1\dots hnh1…hn, where 0 \leq h_i \leq 10000000000≤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.

Example：
input：
7 2 1 4 5 1 3 3
4 1000 1000 1000 1000
0
output：
8
4000

题意：给出n个宽度为1，长度为h[i]的矩形，求连续的完整的矩形的面积为多少。

思路：用数组模仿栈，s[i]表示当前进栈元素的高度，wid[i]表示连续的相同的s[i]的宽度。如果当前元素比栈尾元素小，那么计算栈中符号要求的矩形的面积，然后将栈中比当前元素小的元素出栈，将当前元素如栈，保持栈中元素递增。
因为在计算的过程中没有计算栈尾元素之后的矩形的面积，所以当进栈操作结束后，从栈尾元素不断遍历，寻找最大值。

#include<bits/stdc++.h>
#include<iostream>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>
#include<stack>
using namespace std;
typedef unsigned long long ull;
typedef  long long ll;
#define IOS std::ios::sync_with_stdio(false)
#define ls p<<1
#define rs p<<1|1
#define mod 1000000000 + 7
#define PI acos(-1.0)
#define INF   1e9
#define N 200000 + 5
/*********************Code*********************/
ll n,s[N],wid[N],ans,l,x,w;
int main(void){
    IOS;
    while(cin>>n&&n){
            w = 0,ans = 0,l = 0;
    memset(wid,0,sizeof(wid));
    for(ll i = 0;i < n;i++){
        cin>>x;
        if(s[l]<=x)
            s[++l]=x,wid[l]=1;
        else{
            w = 0;
            while(s[l]>x){
                w +=wid[l];
                ans = max(ans,s[l]*w);
                l--;
            }
            s[++l] = x,wid[l] = w +1;
        }
    }
    w = 0;
    while(l){
        w +=wid[l];
        ans = max(ans,s[l]*w);
        l--;
    }
    cout<<ans<<endl;
    }
    return 0;
}