摘要：先跑spfa求出最短路构成的DAG，然后在DAG上跑出支配树dfs出size取max即可 关于支配树，因为是DAG，支配点就是入点在支配树上的lca，所以一边拓扑一边预处理倍增，然后用倍增求lca cpp include include include include include using n 阅读全文

摘要：求出支配树输出到father的和即可 支配树见：https://blog.csdn.net/a710128/article/details/49913553 cpp include include include include using namespace std; const int N=30 阅读全文