HUD 3308 LCIS
老套路维护以下几个值:
区间最长的递增序列的长度sum
以区间左端点为起点的向右的最长递增序列的长度lsum
以区间右端点为起点的向左的最长递增序列的长度rsum
区间左端点的值lval
区间右端点的值rval
对于push_up操作
先常规的根据左右节点更新当前节点的值
tree[root].lsum = tree[root << 1].lsum;
tree[root].rsum = tree[root << 1 | 1].rsum;
tree[root].sum = max(tree[root << 1].sum, tree[root << 1 | 1].sum);
tree[root].lval = tree[root << 1].lval;
tree[root].rval = tree[root << 1 | 1].rval;
对于左节点的右端点的值小于右节点的左端点的值时
说明可以合并,此时最长递增的区间可能是由合并后的得来需要更新
if (tree[root << 1].rval < tree[root << 1 | 1].lval) {
if (tree[root << 1].len() == tree[root << 1].lsum)tree[root].lsum += tree[root << 1 | 1].lsum;
if (tree[root << 1 | 1].len() == tree[root << 1 | 1].rsum)tree[root].rsum += tree[root << 1].rsum;
tree[root].sum = max(tree[root].sum, tree[root << 1].rsum + tree[root << 1 | 1].lsum);//中间区域
}
tree[root].sum = max(tree[root].sum, max(tree[root].lsum, tree[root].rsum));//两边区域
#include<bits/stdc++.h>
#include <unordered_map>
using namespace std;
template<class...Args>
void debug(Args... args) {
//Parameter pack
auto tmp = {
(cout << args << ' ', 0)... };
cout << "\n";
}
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll>pll;
typedef pair<int, int>pii;
const ll N = 5e5 + 5;
const ll INF = 0x7fffffff;
const ll MOD = 1e9 + 7;
int w[N];
struct node {
int l, r;
int sum, lsum, rsum;
int lval, rval;
int len() {
return r - l + 1; }
};
struct Segtree {
node tree[N << 2];
void push_up(int root) {
tree[root].lsum