摘要：
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 阅读全文
posted @ 2023-09-04 21:41
onlyblues
阅读(55)
评论(0)
推荐(0)
摘要：
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 阅读全文
posted @ 2023-09-04 16:28
onlyblues
阅读(82)
评论(0)
推荐(0)
浙公网安备 33010602011771号