摘要：
#include<iostream> #include<algorithm> #include<cstring> #include<vector> #include<map> #include<cmath> #include<cstdio> #include<queue> typedef long 阅读全文
摘要：
#include<algorithm> #include<cstring> #include<vector> #include<map> #include<cmath> #include<cstdio> #include<queue> #include<iostream> typedef long 阅读全文
摘要：
删除正向不好处理，转为逆向，从最后一个删除的点开始插入 Greg has a weighed directed graph, consisting of n vertices. In this graph any pair of distinct vertices has an edge betwe 阅读全文