啊

线段树提前开20w个点建树就可以直接修改。#include<iostream> #include<cstdio> #define LL long long using namespace std; struct xds { int l,r; LL ma; }tree[800005]; void build(int dq,int l,int r) { tree[dq].l=l;

这道题正解是LCT吗，不理解，用分块水的。#include<iostream> #include<cstdio> #include<cmath> #include<cstdlib> using namespace std; int a[200005]; int b[200005]; int c[200005]; int inf=214748; int ask(int x) { int ans