skyming

摘要： (n^3) -- kruskal 枚举边#include<stdio.h>#include<iostream>#include<algorithm>#include<string.h>#define N 110#define inf 99999999using namespace std;struct node{ int x,y,len;}root[N*N];int n,m,num[N];int top,stack[N];int find(int x){ if(num[x] == x) return x; return num[x] = find 阅读全文