Introduction to Lazy Propagation - Segment Tree （C语言）

Introduction to Lazy Propagation - Segment Tree （C语言）

简介

小白第一篇blog，以下乃本人浅见，如有疏漏，请各位不吝赐教。
本文主要讲述了lazy propagation算法在线段树中的应用。

例题

You are given an array of $n$ integers $a_1$, $a_2$, …, $a_n$, and $q$ commands of two different types.
Type 1 (Query): given 2 integers $l$ and $r$, find the sum of $a_i$, where $l\le i\le r$.
Type 2 (Update): given 3 integers $l$, $r$ and $val$, add $val$ to all $a_i$, where $l\le i\le r$.

Input
The first line contains 2 integers $n$ and $q$. ($1\le n,q\le 10^5$)
The second line contains $n$ integers $a_1$, $a_2$, …, $a_n$ ($1\le n,q\le 10^4$)
The next $q$ lines each contains a command. The first integer in each line denotes the type of command (either 1 or 2).
Type 1 command is followed by 2 integers $l$, $r$. ($1\le l\le r\le n$)
Type 2 command is followed by 3 integers $l$, $r$, $val$. ( 1