摘要: 删除正向不好处理,转为逆向,从最后一个删除的点开始插入 Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge betwe 阅读全文
posted @ 2020-07-25 14:13 Wh1te 阅读(152) 评论(0) 推荐(0) 编辑