不要吝啬线段树的空间

RE代码

const int maxn=2e4+10;
struct stu1{
	int min_num,sum_lazy;
}tree[(maxn<<1)+maxn];

AC代码

const int maxn=2e4+10;
struct stu1{
  int min_num,sum_lazy;
}tree[maxn<<2]