jjmusic 的专栏

#include //矩阵乘法#include using namespace std; typedef vector vec; typedef vertor mat; int m = 100; // a*b mat multi(mat a,mat b) { mat c (a.size(),vec(b[0].size())); for(int i=0 ;i<a.siz

按秩合并 矮树合并到高树 void Union(int a, int b) { if(tree[a].weight == tree[b].weight) { //树高一样 tree[b].parent = a; tree[a].weight += 1; } else if (tree[a].w