2020ICPC江西省赛 H.Sequence（线段树单点修改+查询）

题目大概意思：

给定一个x做为下标，查询a[x]在多少个连续区间内是最小值，还有单点修改。

比较容易想到运用线段树进行单点修改和查询，但是查询的时候要分别往x左边和右边查询，查询的目的是找到x左边第一个小于a[x]且最靠右的数组下标位置，同理右边找最靠左的第一个小于a[x]的下标，左边查询的时候优先查询右边，右边查询的时候优先查询左边，这样才能保证最佳，魔改线段树（其实也算不上魔改吧）细节挺多的，自己没调出来，请xyx大佬调的，还是码力太弱了。。。

对于找不到小于a【x】这种情况要特殊处理一下。

别忘了这题单点修改的时候要改a[x]的值，当时做的时候居然把这个忘了！！！！！

// #pragma GCC optimize(2)
#include <algorithm>
#include <iostream>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <random>
#include <cctype>
#include <bitset>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <set>
#include <map>
#define IO                       \
	ios::sync_with_stdio(false); \
	// cout.tie(0);
#define lson(x) (x << 1)
#define rson(x) (x << 1 | 1)
using namespace std;
// int dis[8][2] = {0, 1, 1, 0, 0, -1, -1, 0, 1, -1, 1, 1, -1, 1, -1, -1};
typedef unsigned long long ULL;
typedef long long LL;
typedef pair<int, int> P;
const int maxn = 1e5 + 10;
const int maxm = 1e7 + 10;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 998244353;
const double eps = 1e-8;
const double pi = acos(-1);
// int dis[4][2] = {1, 0, 0, -1, 0, 1, -1, 0};
// int m[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n, m;
int a[maxn];
int tree[maxn << 2];
void pushup(int node)
{
	tree[node] = min(tree[node << 1], tree[node << 1 | 1]);
}
void creat(int node, int L, int R)
{
	if (L == R)
	{
		tree[node] = a[L];
		return;
	}
	int mid = (L + R) >> 1;
	creat(node << 1, L, mid);
	creat(node << 1 | 1, mid + 1, R);
	pushup(node);
}
void update(int node, int L, int R, int p, int val)
{
	if (L == R)
	{
		a[L] = val;
		tree[node] = val;
		return;
	}
	int mid = (L + R) >> 1;
	if (p <= mid)
		update(node << 1, L, mid, p, val);
	else
		update(node << 1 | 1, mid + 1, R, p, val);
	pushup(node);
	return;
}
LL query1(int node, int start, int end, int L, int R, int val)
{
	if (start == end)
	{
		if (tree[node] < val)
			return end;
		else
			return 0;
	}
	LL rans = 0;
	int mid = (start + end) >> 1;
	if (R >= mid + 1)
	{
		if (tree[node << 1 | 1] < val)
		{
			rans = query1(node << 1 | 1, mid + 1, end, L, R, val);
			if (rans > 0)
				return rans;
		}
	}
	if (tree[node << 1] < val)
	{
		return query1(node << 1, start, mid, L, R, val);
	}
	return 0;
}
LL query2(int node, int start, int end, int L, int R, int val)
{
	if (start == end)
	{
		if (tree[node] < val)
			return end;
		else
			return n + 1;
	}
	LL lans = 0;
	int mid = (start + end) >> 1;
	if (L <= mid)
	{
		if (tree[node << 1] < val)
		{
			lans = query2(node << 1, start, mid, L, R, val);
			if (lans < n + 1)
				return lans;
		}
	}
	if (tree[node << 1 | 1] < val)
	{
		return query2(node << 1 | 1, mid + 1, end, L, R, val);
	}
	return n + 1;
}
int main()
{
#ifdef WXY
	freopen("in.txt", "r", stdin);
	//  freopen("out.txt", "w", stdout);
#endif
	IO;
	int op, x, y;
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	creat(1, 1, n);
	while (m--)
	{
		cin >> op;
		if (op == 1)
		{
			cin >> x >> y;
			update(1, 1, n, x, y);
		}
		else
		{
			cin >> x;
			LL L = x - query1(1, 1, n, 1, x - 1, a[x]);
			LL R = query2(1, 1, n, x + 1, n, a[x]) - x;
			cout << (L * R) << "\n";
		}
	}
	return 0;
}