Learning content : cf1900 title selected brush
The completion of the number of questions today (does not include multi-school) : 8
Today's reading situations : None
Summarize learning algorithm
No
Today do question summary
http://codeforces.com/problemset/problem/1076/E
Meaning of the questions is to select a point and depth than its descendant nodes within large di plus a final query weight weights of all nodes
Ideas: we have to record each operation on each node and then directly to the node depth dfs to change contribution (by segment tree maintenance under) and then back to when revocation
https://paste.ubuntu.com/p/VWH4nBTHcY/
Today's experience:
In the segment tree when writing the return value of the function int ans set the return value of ll answer has burst int can be considered its own careless
Tomorrow tasks:
24 network flow problem