HDUOJ 1506 Largest Rectangle in a Histogram

利用已经找到了的左右边界加快寻找过程。
这也是一种递推的思想吧。

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 100005
#define maxm 10005
#define MOD  10007
#define INF 1000000000
using namespace std;
//-------------------------CHC------------------------------//
int h[maxn], l[maxn], r[maxn];

int main() {
	int n;
	while (SF(n) && n) {
		FOR(i, 0, n) SF(h[i]);
		for (int i = 0; i < n; ++i) {
			int j = i;
			while (j >= 1 && h[j - 1] >= h[i]) j = l[j-1];
			l[i] = j;
		}
		for (int i = n - 1; i >= 0; --i) {
			int j = i;
			while (j <= n - 2 && h[j + 1] >= h[i]) j = r[j + 1];
			r[i] = j;
		}
		LL ans = 0;
		FOR(i, 0, n) ans = max(ans, (LL)(r[i] - l[i] + 1)*h[i]);
		printf("%lld\n", ans);
	}
	return 0;
}