- C24zhouyanchen's blog
print线段树/树状数组
- @ 2025-10-2 11:36:54
typedef long long ll;
void printt(ll n){
ll sum = 0,ans = 1;
for (ll i = 1;i <= 2 * n + 1;i++){
sum++;
cout << tr[i] << ' ';
//cout << tr[i].number << ' ' << tr[i].lazy << " ";
if (sum == ans){
cout << '\n';
sum = 0;
ans *= 2;
}
}
cout << '\n';
return;
}