#include <cstdio>
#include <cstring>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 100000;
const int maxn = 205;
int n,m,head[maxn],len;
struct node{
int to,next;
}tree[maxn*2];
void init(){
memset(head,-1,sizeof(head));
len = 0;
}
void add_eadge(int u,int v){
tree[len].to = v;
tree[len].next = head[u];
head[u] = len++;
}
int d[maxn][maxn],temp[maxn],w[maxn];
void dfs(int root,int f){
for(int i=0......
阅读全文