Gufen: \ (100 + 60 + 40 = 200 \)
examination: \ (100 + 60 + 0 = 160 \)
\ (emmm \) , I T3 push equation seems to be wrong (?)?
\ (T1 \)
Direct segment tree can be.
\(T2\)
It is easy to think of the tree section, but log ^ 2nTLE60. Optimization or positive solution did not expect.
Positive solutions very wonderful, not backwards to cover the direct disjoint-set just fine.
\ (T3 \)
Push himself a formula:
\ (Sigma (. 1 <= I <= n-) C (m / 2, (I-n-+. 1) * m / 2) * ((m-2)) ^ 2 * n-! ^ {n * m / 2}
\) results \ (WA0 \) ......
listening feel after speaking except understand other recursive understand.
to sum up
Thinking sometimes against, the problem may become more easier.
Push the formula time to consider the whole situation.
Control algorithm is not in place, the time to learn to be careful.
Number theory seems to knowledge is not enough, to a lot of strengthening.