codeforces 438D The Child and Sequence（线段树）

At the children’s day, the child came to Picks’s house, and messed his house up. Picks was angry at him. A lot of important things were lost, in particular the favorite sequence of Picks.

Fortunately, Picks remembers how to repair the sequence. Initially he should create an integer array a[1], a[2], …, a[n]. Then he should perform a sequence of m operations. An operation can be one of the following:

Print operation l, r. Picks should write down the value of .
Modulo operation l, r, x. Picks should perform assignment a[i] = a[i] mod x for each i (l ≤ i ≤ r).
Set operation k, x. Picks should set the value of a[k] to x (in other words perform an assignment a[k] = x).
Can you help Picks to perform the whole sequence of operations?

Input
The first line of input contains two integer: n, m (1 ≤ n, m ≤ 105). The second line contains n integers, separated by space: a[1], a[2], …, a[n] (1 ≤ a[i] ≤ 109) — initial value of array elements.

Each of the next m lines begins with a number type .

If type = 1, there will be two integers more in the line: l, r (1 ≤ l ≤ r ≤ n), which correspond the operation 1.
If type = 2, there will be three integers more in the line: l, r, x (1 ≤ l ≤ r ≤ n; 1 ≤ x ≤ 109), which correspond the operation 2.
If type = 3, there will be two integers more in the line: k, x (1 ≤ k ≤ n; 1 ≤ x ≤ 109), which correspond the operation 3.
Output
For each operation 1, please print a line containing the answer. Notice that the answer may exceed the 32-bit integer.

Examples
inputCopy
5 5
1 2 3 4 5
2 3 5 4
3 3 5
1 2 5
2 1 3 3
1 1 3
outputCopy
8
5
inputCopy
10 10
6 9 6 7 6 1 10 10 9 5
1 3 9
2 7 10 9
2 5 10 8
1 4 7
3 3 7
2 7 9 9
1 2 4
1 6 6
1 5 9
3 1 10
outputCopy
49
15
23
1
9
Note
Consider the first testcase:

At first, a = {1, 2, 3, 4, 5}.
After operation 1, a = {1, 2, 3, 0, 1}.
After operation 2, a = {1, 2, 5, 0, 1}.
At operation 3, 2 + 5 + 0 + 1 = 8.
After operation 4, a = {1, 2, 2, 0, 1}.
At operation 5, 1 + 2 + 2 = 5.

---

比较蠢的题吧。
一个数至多被 $\%log$ 次就会变成 $0$
维护个区间最大值，如果 $x>$ 区间最大值就退出，否则就递归下去

只有单点修改
复杂度 $O(qlognlog{a}_i)$

#include<bits/stdc++.h>
using namespace std;
namespace io {
	const int SIZE = (1 << 21) + 1;
	char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c, qu[55]; int f, qr;
	// getchar
	#define gc() (iS == iT ? (iT = (iS = ibuf) + fread (ibuf, 1, SIZE, stdin), (iS == iT ? EOF : *iS ++)) : *iS ++)
	// print the remaining part
	inline void flush () {
		fwrite (obuf, 1, oS - obuf, stdout);
		oS = obuf;
	}
	// putchar
	inline void putc (char x) {
		*oS ++ = x;
		if (oS == oT) flush ();
	}
	// input a signed integer
	template <class I>
	inline void gi (I &x) {
		for (f = 1, c = gc(); c < '0' || c > '9'; c = gc()) if (c == '-') f = -1;
		for (x = 0; c <= '9' && c >= '0'; c = gc()) x = x * 10 + (c & 15); x *= f;
	}
	// print a signed integer
	template <class I>
	inline void print (I &x) {
		if (!x) putc ('0'); if (x < 0) putc ('-'), x = -x;
		while (x) qu[++ qr] = x % 10 + '0',  x /= 10;
		while (qr) putc (qu[qr --]);
	}
	//no need to call flush at the end manually!
	struct Flusher_ {~Flusher_(){flush();}}io_flusher_;
}
using io :: gi;
using io :: putc;
using io :: print;
#define rep(i,j,k) for(int i = j;i <= k;++i)
#define repp(i,j,k) for(int i = j;i >= k;--i)
#define ll long long
#define ls (rt<<1)
#define rs (rt<<1|1)
int n,m;
int mx[401000];
ll sum[401000];
int a[101000];
inline int max(int a,int b){return a>b?a:b;}
void update(int rt){mx[rt] = max(mx[ls],mx[rs]);sum[rt] = sum[ls] + sum[rs];}
void build(int rt,int l,int r){
	if(l == r) {mx[rt] = a[l];sum[rt] = a[l];return;}
	int mid = (l+r)>>1;
	build(ls,l,mid); build(rs,mid+1,r);
	update(rt);
}
ll query(int rt,int l,int r,int x,int y){
	if(x <= l && r <= y) return sum[rt];
	if(l > y || r < x) return 0;
	int mid = (l+r)>>1;
	return query(ls,l,mid,x,y) + query(rs,mid+1,r,x,y);
}
void Mod(int rt,int l,int r,int x,int y,int v){
	int mid = (l+r)>>1;
	if(r < x || l > y) return;
	if(l == r){
		mx[rt] %= v;sum[rt] = mx[rt];
		return;
	}
	if(x <= l && r <= y) {
		if(mx[rt] < v) return;
		Mod(ls,l,mid,x,y,v); Mod(rs,mid+1,r,x,y,v);
		update(rt);
	}
	Mod(ls,l,mid,x,y,v); Mod(rs,mid+1,r,x,y,v);
	update(rt);
}
void change(int rt,int l,int r,int pl,int v){
	if(l == r){mx[rt] = sum[rt] = v;return;}
	int mid = (l+r)>>1;
	if(pl <= mid) change(ls,l,mid,pl,v);
	else change(rs,mid+1,r,pl,v);
	update(rt);
}
int main(){
	freopen("1.in","r",stdin);
	gi(n); gi(m); rep(i,1,n) gi(a[i]);
	build(1,1,n);
	rep(i,1,m){
		int op,l,r,x;gi(op); 
		if(op == 1) {
			gi(l);gi(r); printf("%lld\n",query(1,1,n,l,r));
		}
		else if(op == 2){
			gi(l);gi(r);gi(x); Mod(1,1,n,l,r,x);
		}
		else gi(l),gi(x),change(1,1,n,l,x);
	}
    return 0;
}