摘要：
F1. Omsk Metro (simple version) This is the simple version of the problem. The only difference between the simple and hard versions is that in this ve 阅读全文
摘要：
Minimum Edge Weight Equilibrium Queries in a Tree There is an undirected tree with n nodes labeled from 0 to n - 1. You are given the integer n and a 阅读全文