这里会显示出您选择的修订版和当前版本之间的差别。
两侧同时换到之前的修订记录 前一修订版 | |||
2023-2024:teams:al_in_and_back_to_whk:d [2023/07/18 22:41] pigpigger 移除 |
— (当前版本) | ||
---|---|---|---|
行 1: | 行 1: | ||
- | After each operation the pre-order remain unchanged, so for a right son, it change its father to 1 step backward. If you cannot do that, puts 0. For a left son, you can assign arbitrary steps less than k for it to "climb up" the chain. So the problem is reduced to given some intervals(right sons) and you can add new intervals(left sons). | + |