csp-s Analog 58

T1:
  break out statistics about the number of each factor on the line, you can use the hash table
 
T2:
  Press the backpack after time to do the sort
  found no way to backpack Price range too, so will reverse the state, instead of the value of the backpack
  defined backpack becomes the minimum cost necessary to obtain the value of i's
  answer on an array of backpack-half on the line
 
T3:
  good question ah!
  Consider regarded as the vehicle speed time, the side l, r can be regarded as this edge passage of time
  and the minimum time to large enumeration, obtains edge forest possible currently constituted the largest diameter
  but not actually enumerated
  It found that each side effects range is a range, it is possible to divide and conquer tree line, with a rollback of disjoint-set to maintain the diameter of the tree