2023-2024:teams:al_in_and_back_to_whk:23-nowcoder-1:g
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).
2023-2024/teams/al_in_and_back_to_whk/23-nowcoder-1/g.txt · 最后更改: 2023/07/18 22:41 由 pigpigger
