XDU暑训2019 Day6 POJ2452 ST表

题意：取区间(i, j)为区间内所有数比a[i]大，比a[j]小，求一个序列中j-i最大值
思路：用ST表存储各区间最值，首先求条件1，枚举每个i，用二分法求不满足条件的i,j的第一个j，而条件2则需要j为之前求(i,j)中的最大值下标，取这些满足条件的i,j中的j-i最大值输出

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn = 50005;
map<int, int> id;
int Log2[maxn], n, maxx[maxn][30], minn[maxn][30], a[maxn], l, r, t;
int queryMax(int l, int r)
{
	int x = Log2[r-l+1];
	return max(maxx[l][x], maxx[r-(1<<x)+1][x]);
}
int queryMin(int l, int r)
{
	int x = Log2[r-l+1];
	return min(minn[l][x], minn[r-(1<<x)+1][x]);
}
int main()
{
	Log2[1] = 0;
	for (int i = 2; i < maxn; i++)
		Log2[i] = Log2[i>>1] + 1;
	while (~scanf("%d", &n)) {
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			id[a[i]] = i;
			maxx[i][0] = a[i];
			minn[i][0] = a[i];
		}
		for (int i = n; i >= 1; i--)
			for (int j = 1; i+(1<<j)-1 <= n; j++) {
				maxx[i][j] = max(maxx[i][j-1], maxx[i+(1<<j-1)][j-1]);
				minn[i][j] = min(minn[i][j-1], minn[i+(1<<j-1)][j-1]);
			}
		int ans = -1;
		for (int i = 1; i < n; i++) {
			l = i+1, r = n, t = 0;
			while (r > l+1) {
				int mid = (l + r) / 2;
				if (queryMin(i, mid) == a[i]) l = mid;
				else	r = mid;
			}
			if (queryMin(i, r) == a[i])	t = r;
			else if (queryMin(i, l) == a[i]) t = l;
			if (t == 0)	continue;
			ans = max(ans, id[queryMax(i, t)] - i);
		}
		printf("%d\n", ans);
	}
	return 0;
}