CF - 1156E - Special Segments of Permutation

https://codeforces.com/problemset/problem/1156/E

合理分析复杂度

想到正解但是不敢做系列
预处理以每个点（若为$i$）为区间最大的最长段，在该段统计答案。枚举该段左半段（或右半段）的元素（若大小为$p$），判断在另半段有没有$a[i]-p$存在（储存某个数在$a$数列中出现的位置即可$O(1)$判断），若存在即统计答案。
寻常一想感觉是 $O(n^2)$的，但是！若考虑某个点被处理的次数，这个次数不会大于$log(n)$次。具体原因可以考虑每次选当前区间最大的处理，每次将整个区间一分为二，这个点不会被大于$log(n)$个处理区间覆盖。

#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int Maxn = 201000;

int n, a[Maxn], f[Maxn][31], lm[Maxn], rm[Maxn], p[Maxn];
long long ans;

int Max(int l, int r) {
	int m = 0; while((1 << m) <= r - l + 1) ++m; --m;
//	cout << m << endl;
	return max(f[l][m], f[r - (1 << m) + 1][m]);
}

int Get(int m, int x, int t) {
	int l = (t == 0) ? 1 : m;
	int r = (t == 0) ? m : n, ans = 0;
	while(l <= r) {
		int mid = (l + r) / 2;
		int L = (t == 0) ? mid : m;
		int R = (t == 0) ? m : mid;
		if(Max(L, R) <= x) {
			ans = mid;
			if(t == 0) r = mid - 1;
			else l = mid + 1;
		}
		else {
			if(t == 0) l = mid + 1;
			else r = mid - 1;
		}
	} return ans;
}

int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) {
		scanf("%d", &a[i]); p[a[i]] = i;
		f[i][0] = a[i];
	}
	for(int j = 1; j <= 30; ++j) {
		for(int i = 1; i <= n; ++i) {
			f[i][j] = f[i][j - 1];
			if(i + (1 << (j - 1)) <= n) {
				f[i][j] = max(f[i][j], f[i + (1 << (j - 1))][j - 1]);
			}
		}
	}
	for(int i = 1; i <= n; ++i) {
		lm[i] = Get(i, a[i], 0);
		rm[i] = Get(i, a[i], 1);
	}
	for(int i = 1; i <= n; ++i) {			
		int L1 = 0, R1 = 0, L2 = 0, R2 = 0;
		if(rm[i] - i + 1 <= i - lm[i] + 1) {
			L1 = i + 1, R1 = rm[i];
			L2 = lm[i], R2 = i - 1;
		}
		else {
			L1 = lm[i], R1 = i - 1;
			L2 = i + 1, R2 = rm[i];
		}
		for(int j = L1; j <= R1; ++j) {
			if(p[a[i] - a[j]] >= L2 && p[a[i] - a[j]] <= R2) ++ans;
		}
	}
	cout << ans << endl;
	return 0;
}