2019年7月14日
Atcoder2134 Zigzag MST
摘要： 问题描述 We have a graph with N vertices, numbered 0 through N −1. Edges are yet to be added. We will process Q queries to add edges. In the i th (1≦ i ≦ 阅读全文
posted @ 2019-07-14 13:17 CJlzf 阅读(153) 评论(2) 推荐(0) 编辑