1 for(ll i=1;i<=n;++i) f[i][0]=a[i],g[i][0]=a[i]; 2 for(ll j=1;(1<<j)<=n;++j) 3 for(ll i=1;(i+(1<<j)-1)<=n;i++) 4 { 5 f[i][j]=f[i][j-1]&f[i+(1<<(j-1))][j-1]; 6 g[i][j]=g[i][j-1]|g[i+(1<<(j-1))][j-1]; 7 } 8 ll qu(ll l,ll r) //& 9 { 10 ll k=log2(r-l+1); 11 return f[l][k]&f[r-(1<<k)+1][k]; 12 } 13 ll ru(ll l,ll r) //| 14 { 15 ll k=log2(r-l+1); 16 return g[l][k]|g[r-(1<<k)+1][k]; 17 }