hdoj 1506 | poj 2559 Largest Rectangle in a Histogram

类型：递推

题目：http://poj.org/problem?id=2559

思路：从左向右扫一遍，记录l[i](以i为最低高度的左边界)，从右向左扫一遍，记录r[i](以i为最低高度的右边界)

从左向右扫描时，判断当前位置的前一个位置，如果该位置的hi值大于当前位置的hi值，则更新当前l[i]值为l[i] - 1

位置的l[l[i] - 1]值，循环直至l[i] - 1位置的hi小于当前位置的hi。从右往左类似。

！！！长整数用__int64

// hdoj 1506 Largest Rectangle in a Histogram
// tle wa wa wa ac 62MS	1412K
#include <iostream>
#include <sstream>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include <map>
#include <algorithm>
#include <numeric>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <set>
#include <deque>
#include <bitset>
#include <functional>
#include <utility>
#include <iomanip>
#include <cctype>
using namespace std;

#define FOR(i,a,b) for(i = (a); i < (b); ++i)
#define FORE(i,a,b) for(i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(i = (a); i > (b); --i)
#define FORDE(i,a,b) for(i = (a); i >= (b); --i)
#define max(a,b) ((a) > (b)) ? (a) : (b)
#define min(a,b) ((a) < (b)) ? (a) : (b)
#define CLR(a,b) memset(a,b,sizeof(a))
#define PB(x) push_back(x)

const int MAXN = 100010;
const int MAXM = 0;
const int hash_size = 25000002;
const int INF = 0x7f7f7f7f;

int n;
int h[MAXN], l[MAXN], r[MAXN];

void solve() {
    int i;

    FORE(i, 1, n)
        while(h[l[i] - 1] >= h[i])
            l[i] = l[l[i] - 1];
    FORDE(i, n, 1)
        while(h[r[i] + 1] >= h[i])
            r[i] = r[r[i] + 1];
    __int64 sum = 0;
    FORE(i, 1, n)
        if(sum < (__int64)(h[i]) * (__int64)(r[i] - l[i] + 1))
            sum = (__int64)(h[i]) * (__int64)(r[i] - l[i] + 1);
    printf("%I64d\n", sum);
}

int main() {
    int i;

    while(scanf("%d", &n) == 1, n) {
        FORE(i, 1, n) {
            scanf("%d", &h[i]);
            l[i] = r[i] = i;
            h[0] = h[n + 1] = -1;
        }
        solve();
    }
    return 0;
}