###### programming

####
2020 CCPC Wannafly Winter Camp Day1 IK decimal query (line segment tree set weight line segment tree)

Title: Given a sequence AAA of length nnn and mmm operations. There are two operations: (1, l, r, x) (1 l r n, 1 x 1 0 9) (1,l,r,x) \left(1\leq l\leq r\leq n,\ 1\leq x\leq10^9\right) (1,l,r,x)(1 l r n, 1 x 109), which means that for i [l, r] let A i = min (A i, x) \forall i\in\left[l,r\right] Let A_i=\min\left(A_i,x\right) i [l,r] Let Ai =min( Ai ,x) (2, l, r, k) (1 l r n, 1 k r l + 1) (2,l,r,k) \left(1\leq l\leq r\leq n ,\ 1\leq k\leq r-l+1\right) (2,l,r,k)(1 l r n, 1 k r l+1), which means the