苟为蒟蒻又何妨

传送门 其实求一个图删除一个点之后，联通块最多有多少。 直接tarjan求割点更新答案就行了。 但注意原图不一定连通。 代码： #include<iostream> #include<cstring> #include<cstdio> #include<vector> #define N 10005 using namespace st...

描述 There are exactly nn towns in Byteotia. Some towns are connected by bidirectional roads. There are no crossroads outside towns, though there may be bridges, tunnels and flyovers. Each pair of to...