codeforces 1567E. Non-Decreasing Dilemma（线段树/计数）

题目链接：Problem - 1567E - Codeforces

大致题意：

动态维护一个数组，每次可以修改数组里一位数字，或者查询数组中一个区间内，连续非降子序列的总数量。

题解：

裸线段树维护数组，codeforces标记是2200分难度，但是也就是代码长度大一点。。。

每个node维护左侧最长的连续非降串长跟右侧的最长非降串长。以及node区间内连续非降子序列的总数量。

数量合并方法：

	tree[pos].lLen = tree[pos * 2].lLen;
	tree[pos].rLen = tree[pos * 2 + 1].rLen;
	tree[pos].tot = tree[pos * 2].tot + tree[pos * 2 + 1].tot;
	if (a[mid] <= a[mid + 1]) {
		tree[pos].tot += 1LL * tree[pos * 2].rLen * tree[pos * 2 + 1].lLen;
		if (tree[pos * 2].lLen == (mid - l + 1)) {
			tree[pos].lLen += tree[pos * 2 + 1].lLen;
		}
		if (tree[pos * 2 + 1].rLen == (r - mid)) {
			tree[pos].rLen += tree[pos * 2].rLen;
		}
	}

最终完整代码如下：

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2 * 1'000'00 + 10;
int n, q, ql, qr;
int a[MAXN];
struct Node{
	int lLen;
	int rLen;
	long long tot;
} tree[MAXN * 4];
void buildTree(int pos, int l, int r) 
{
	if (l == r) {
		tree[pos].lLen = 1;
		tree[pos].rLen = 1;
		tree[pos].tot = 1;
		return;
	}
	int mid = (l + r) / 2;
	buildTree(pos * 2, l, mid);
	buildTree(pos * 2 + 1, mid + 1, r);
	tree[pos].lLen = tree[pos * 2].lLen;
	tree[pos].rLen = tree[pos * 2 + 1].rLen;
	tree[pos].tot = tree[pos * 2].tot + tree[pos * 2 + 1].tot;
	if (a[mid] <= a[mid + 1]) {
		tree[pos].tot += 1LL * tree[pos * 2].rLen * tree[pos * 2 + 1].lLen;
		if (tree[pos * 2].lLen == (mid - l + 1)) {
			tree[pos].lLen += tree[pos * 2 + 1].lLen;
		}
		if (tree[pos * 2 + 1].rLen == (r - mid)) {
			tree[pos].rLen += tree[pos * 2].rLen;
		}
	}
}
void updateTree(int n, int l, int r, int pos)
{
	if (l == r) {
		return;
	}
	int mid = (l + r) / 2;
	if (n <= mid) {
		updateTree(n, l, mid, pos * 2);
	}
	if (mid < n) {
		updateTree(n, mid + 1, r, pos * 2 + 1);
	}
	tree[pos].lLen = tree[pos * 2].lLen;
	tree[pos].rLen = tree[pos * 2 + 1].rLen;
	tree[pos].tot = tree[pos * 2].tot + tree[pos * 2 + 1].tot;
	if (a[mid] <= a[mid + 1]) {
		tree[pos].tot += 1LL * tree[pos * 2].rLen * tree[pos * 2 + 1].lLen;
		if (tree[pos * 2].lLen == (mid - l + 1)) {
			tree[pos].lLen += tree[pos * 2 + 1].lLen;
		}
		if (tree[pos * 2 + 1].rLen == (r - mid)) {
			tree[pos].rLen += tree[pos * 2].rLen;
		}
	}
}
Node queryTree(int l, int r, int pos)
{
	if (ql <= l && r <= qr) {
		Node res = {tree[pos].lLen, tree[pos].rLen, tree[pos].tot};
		return res;
	}
	Node res = {0, 0, 0};
	Node res1 = {0, 0 ,0};
	Node res2 = {0, 0, 0};
	int mid = (l + r) / 2;
	if (ql <= mid) {
		res1 = queryTree(l, mid, pos * 2);
		res = res1;
	}
	if (mid < qr) {
		res2 = queryTree(mid + 1, r, pos * 2 + 1);
		res.tot += res2.tot;
		res.rLen = res2.rLen;
		if (res1.lLen == 0) {
			res.lLen = res2.lLen;
		}
	}
	if (res1.lLen != 0 && res2.lLen != 0 && a[mid] <= a[mid + 1]) {
		res.tot += 1LL * res1.rLen * res2.lLen;
		if (res1.lLen == (mid - max(l, ql) + 1)) {
			res.lLen += res2.lLen;
		}
		if (res2.rLen == (min(r, qr) - mid)) {
			res.rLen += res1.rLen;
		}
	}
	return res;
}
int main()
{
	scanf("%d%d", &n, &q);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	buildTree(1, 1, n);
	for (int i = 0; i < q; i++) {
		int t, p1, p2;
		scanf("%d%d%d", &t, &p1, &p2);
		if (t == 1) {
			a[p1] = p2;
			updateTree(p1, 1, n, 1);
		}
		else {
			ql = p1;
			qr = p2;
			Node ans = queryTree(1, n, 1);
			cout << ans.tot << endl;
		}
	}
}