线段树求助 30pts!

#include<bits/stdc++.h>
using namespace std;
#define int long long

const int N=4e5+10;
int n,m,a[N];
struct node{
	int val;
	bool lazy;
}b[N];
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			f = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 3) + (x << 1) + (ch ^ 48);
		ch = getchar();
	}
	return x * f;
}
inline void write(int x) {
	if (x < 0) {
		putchar('-');
		x = -x;
	}
	if (x > 9)
		write(x / 10);
	putchar(x % 10 + '0');
}
void pushup(int x){
	b[x].val=max(b[x*2].val,b[x*2+1].val);
	b[x].lazy=(b[x*2].lazy&&b[x*2+1].lazy);
}
void build(int x,int l,int r){
	b[x].lazy=0;
	if(l==r){
		b[x].val=a[l];
		b[x].lazy=(a[l]==1);
		return;
	}
	int mid=l+r>>1;
	build(x*2,l,mid);
	build(x*2+1,mid+1,r);
	pushup(x);
}
void pushdown(int x){
	if(b[x].lazy){
		b[x*2].lazy=true;
		b[x*2+1].lazy=true;
		b[x*2].val=1;
		b[x*2+1].val=1;
	}
}
void update(int x,int l,int r,int L,int R){
	if(b[x].lazy) return;
	
	if(l==r){
		if(a[l]>1){
			int plu=(int)log2(a[l]);
			a[l]+=plu;
			b[x].val=a[l];
			if(a[l]==1) b[x].lazy=true;
		}
		return;
	}
	pushdown(x);
	int mid=l+r>>1;
	if(L<=mid) update(x*2,l,mid,L,R);
	if(R>mid) update(x*2+1,mid+1,r,L,R);
	pushup(x);
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;i++) cin>>a[i];
	build(1,1,n);
	while(m--){
		int l,r;
		cin>>l>>r;
		update(1,1,n,l,r);
	}
	for(int i=1;i<=n;i++) cout<<a[i]<<" ";
	return 0;
}