Some techniques [continuously updated]

  • In addition to traversing the outside, it can be used to initialize an array dp
  • Tree maintenance problem of information, consider heuristic merge (or two-dimensional tree maintenance program dp)
    • Son weight according to size: the heavy chain split
    • Divided by the length of the severity of his son: long-chain split
  • Number of colors tree maintenance, mex considered block
  • bool open barrel can be considered no less than open bitset

 

Guess you like

Origin www.cnblogs.com/linzhuohang/p/12389133.html