新新人類

摘要： ```cpp include include include include include include include include define lson(p) (p st; int ind,ans; void init(){ tot = 0; memset(head, 1,sizeof 阅读全文

摘要： 题意: 求权值最小的割边 思路: $low[v] dfn[u]$ 则 $u v$ 这条边则为割边,由于有重边(重边一定不是割边),加个判断是否为第一次访问到父亲即可. cpp include include include include include include define ll long 阅读全文