摘要：
数据结构上机课，无聊。。。（严蔚敏那本书上的例题）/*Another: VonData: 2011/09/06*/#include <iostream>#include <cstdio>#include <cstring>#include <cstdlib>using namespace std;const int LIST_SIZE = 100;const int LISTINCREMENT = 10;struct sqlist{ int * elem; int len; int listsize;};//creatint InitList_s 阅读全文
摘要：
#include <iostream>#include <cstdio>#include <cstring>#pragma comment(linker,"/STACK:655360000");using namespace std;const int N = 1002;int f[N], rank[N];int find(int x){ int k, r, j; r = x; while(r != f[r]) { r = f[r]; } k = x; while(k != r) { j = f[k]; ... 阅读全文