#[derive(Debug, Clone)] struct SegmentTree { n: usize, orgn: usize, unit: T, mem: Vec, operator: F } impl SegmentTree where T: std::fmt::Debug + Copy, F: Fn(T, T) -> T { fn new(n: usize, unit: T, operator: F) -> Self { let mut size = 1usize; while size < n { size *= 2; } Self { n: size, orgn: n, unit: unit, mem: vec![unit; size*2-1], operator: operator, } } fn find_closed(&self, l: usize, r: usize) -> T { self.find(l, r+1) } fn find(&self, l: usize, r: usize) -> T { self._find(l, r, 0, 0, self.n) } fn set(&mut self, pos: usize, val: T) { let mut pos = pos + self.n - 1; self.mem[pos] = val; while pos > 0 { pos = self._parent(pos); self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]); } } fn get(&mut self, pos: usize) -> T { self.mem[pos + self.n - 1] } fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T { if r <= a || b <= l { return self.unit; } else if a <= l && r <= b { return self.mem[nodenum]; } let left = self._find(a, b, self._left(nodenum), l, (l+r)/2); let right = self._find(a, b, self._right(nodenum), (l+r)/2, r); (self.operator)(left, right) } fn _left(&self, k: usize) -> usize { 2*k+1 } fn _right(&self, k: usize) -> usize { 2*k+2 } fn _parent(&self, k: usize) -> usize { (k-1)/2 } } fn main() { let mut nq = String::new(); std::io::stdin().read_line(&mut nq).ok(); let nq: Vec = nq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = nq[0]; let q = nq[1]; let mut a = String::new(); std::io::stdin().read_line(&mut a).ok(); let a: Vec = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let queries = (0..q).map(|_| { let mut temp = String::new(); std::io::stdin().read_line(&mut temp).ok(); let temp: Vec = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); temp }) .collect::>(); let mut b = vec![0isize; n+1]; for i in 1..n { b[i] = a[i] - a[i-1]; } b[0] = a[0]; b[n] = -a[n-1]; let mut segtree = SegmentTree::new(n+1, 0usize, |x, y| x + y); for i in 0..=n { segtree.set(i, if b[i] == 0 { 0 } else { 1 }); } for v in queries.iter() { let l = v[1]-1; let r = v[2]-1; if v[0] == 1 { let x = v[3] as isize; b[l] += x; b[r+1] -= x; segtree.set(l, if b[l] == 0 { 0 } else { 1 }); segtree.set(r+1, if b[r+1] == 0 { 0 } else { 1 }); } else { if l == r { println!("1"); } else { println!("{}", 1 + segtree.find_closed(l+1, r)); } } } }