- gf24153's blog
《Mod笔谈：倍增》
-
gf24153 LV 8 @ 2025-7-20 16:49:28
for(int j=1;j<=log[n];j++){
for(int i=1;i+(1<<j)-1<=n;i++){
f[i][j]=min(f[i][j-1],f[i+(1<<j-1)][j-1]);
}
}
gf24153
LV 8
@
2025-7-20 16:49:28
for(int j=1;j<=log[n];j++){
for(int i=1;i+(1<<j)-1<=n;i++){
f[i][j]=min(f[i][j-1],f[i+(1<<j-1)][j-1]);
}
}