lowbit 线段树

我觉得我做不出来

特点是进行lowbit运算，有个特点，原来都是没有规律的，进行log次左右之后就会有规律，那么之前我们就可以采用递归到底的方法来进行修改，然后tag满足条件之后我们就可以直接执行大区间的修改了；
不要觉得自己做不出来，有时候看起来很难的东西试试就出来了；
下面这个是lowpos版本的；

#include<iostream>
#include<cstdio>
using namespace std;
#define int long long
const int mod = 998244353;
const int N = 1e5 +10;
struct node {
	int l,r,sum,lowpos;
	int tag;
}tr[N << 3];
int a[N];
int n,q;
int pw[50] = {1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,
32768,65536,131072,262144,524288,1048576,2097152,4194304,8388608,16777216,3554432,
67108864,134217728,268435456,536870912,1073741824,2147483648,4294967296,8589934592,17179869184,
3459738368} ;
int find (int x) {
	int l = 0, r = 35;
	while(l < r) {
		int mid = (l + r) >> 1;
		if(pw[mid] >= x) r = mid;
		else  l = mid + 1;
	}
	return l;
}
void pushup(int u) {
	tr[u].sum = tr[u<<1].sum + tr[u<<1|1].sum;
	tr[u].tag = tr[u<<1].tag & tr[u<<1|1].tag;
}

void build(int u,int l,int r) {
	
	if( l == r) {
		tr[u].l = l, tr[u].r = r , tr[u].sum = a[l];
		tr[u].tag = tr[u].sum & 1;	tr[u].lowpos = find( a[l] & -a[l] );
		
//		printf("u:%lld   l:%lld   r:%lld   sum:%lld   lowbit:%lld   lowpos:%lld\n",
//		u,tr[u].l,tr[u].r,tr[u].sum,tr[u].sum & -tr[u].sum, tr[u].lowpos);
		
		
		return;
	}
	
	tr[u].l = l, tr[u].r = r;
	int mid = (l + r ) >> 1;
	build(u<<1,l,mid);
	build(u<<1|1,mid+1,r);
	pushup(u);
	
	
	
	return;
}

void modify(int u,int l,int r)  {
	if (tr[u].l == tr[u].r) {
		if(tr[u].tag ) return;
		tr[u].sum += tr[u].lowpos;
		tr[u].lowpos = find( tr[u].sum & -tr[u].sum ) ;
		tr[u].tag = tr[u].sum & 1;
		return ;
	}
	else if( tr[u].l >= l && tr[u].r <= r){
		if( tr[u].tag ) return ;
		modify(u<<1,l,r);
		modify(u<<1|1,l,r);
		pushup(u);
		return;
	}
	
	int mid = (tr[u].l + tr[u].r ) >> 1 ;
	if ( l <= mid ) modify(u<<1,l,r);
	if ( r > mid ) 	modify(u<<1|1,l,r);
	
	pushup(u);
	
}

int query(int u,int l,int r) {
	
	if ( tr[u].l >= l && tr[u].r <= r) {
		return tr[u].sum;
	}
	
	int mid = (tr[u].l + tr[u].r) >> 1;
	
	int res = 0;
	
	if( l <= mid) res += query(u<<1,l,r);
	if( r > mid ) res += query(u<<1|1,l,r);
	
	return res;  
}
signed main()
{
	
	scanf("%lld",&n);
	
	for(int i=1;i<=n;i++) {
		scanf("%lld",&a[i]);
	}
	
	build(1,1,n);
	
//	for(int u=1;u<=9;u++) {
//		printf("u:%lld   l:%lld   r:%lld   sum:%lld   lowbit:%lld   lowpos:%lld   tag:%lld\n",
//		u,tr[u].l,tr[u].r,tr[u].sum,tr[u].sum & -tr[u].sum, tr[u].lowpos,tr[u].tag);
//	}
	
	scanf("%lld",&q);
	int op,l,r;
	while ( q -- ) {
		scanf("%lld%lld%lld",&op,&l,&r);
		if ( op == 1 ) {
			modify(1,l,r);
		} else {
			int res = query(1,l,r);
			printf("%lld\n",res % mod);
		}
	}

	return 0;
	
	
}
/*
5
1 2 3 4 5
5
2 2 4
1 1 3
2 2 4
1 1 5
2 4 5
*/