硕鼠的博客

// // Created by liyuanshuo on 2017/3/15. // #include #include #include #include const int inf = 0x7fffffff; const int Maxnn = 10010; int d[Maxnn];//p[Maxnn]; int inq[Maxnn]; int ub[Maxnn], vb[Ma

// // Created by liyuanshuo on 2017/3/14. // #include #include #include #include const int Max = 100010; const int INF = 0x7fffffff; int ns, ms; int first[Max]; int ua[Max], va[Max], wa[Max], nex

// // Created by liyuanshuo on 2017/3/13. //#include <bits/stdc++.h>int r[10010]; //the rank of every side int u[10010], v[10010], w[10010]; // u, v is the pointer of i-th side of graph, w---weight int

// // Created by liyuanshuo on 2017/3/13. // #include const int max_cost = 0x7fffffff; //int graph[10010][10010]; int prime(int graph[][10010], int n) { int lowcost[10010]; int mst[10010]; int