随笔分类 -  5.0.0 图论

摘要:=============================以下是最小生成树+并查集====================================== 【HDU】 1213 How Many Tables 基础并查集★ 1272 小希的迷宫 基础并查集★ 1325&&poj1308 Is I 阅读全文
posted @ 2017-12-18 11:16 Mr_Wolfram 阅读(556) 评论(4) 推荐(0)
摘要:图论模板 LCA 离线 tarjan prim,复杂度与dijkstra相似,稍后再看 include include include include include include using namespace std; const int MAXN=5005,MAXM=200005; int 阅读全文
posted @ 2017-11-20 21:40 Mr_Wolfram 阅读(214) 评论(0) 推荐(0)