km标号算法

bool diss(int x){
	int i,t;
	visx[x]=true; 
	fo(i,1,c[0]){
		if (!visy[i] && map[x][i]){
			t=wx[x]+wy[i]-dis[x][i];
			if (t==0){
				visy[i]=true;
				if (!linky[i] || diss(linky[i])){
					linkx[x]=i,linky[i]=x;
					return true;
				}
			}else{
				if (t>0) minz=min(minz,t);
			}
		}
	}
	return false;
}
void work(int x,int y){
	int i,z,j;
	mec(b,son[x]),mec(c,son[y]);
	mem(linkx,0),mem(linky,0),mem(dis,0),mem(wx,0),mem(wy,0),mem(map,false);
	fo(i,1,b[0])
		fo(j,1,b[0]){
			if (hash[b[i]]==hash[c[j]]){
				map[i][j]=true,dis[i][j]=f[b[i]][c[j]],wx[i]=max(wx[i],f[b[i]][c[j]]);	
			}
		}
	fo(i,1,b[0]){
		while (1){
			mem(visx,false),mem(visy,false);
			minz=1000;
			if (diss(i)) break;
			fo(j,1,b[0]) 
				if (visx[j]) wx[j]-=minz;
			fo(j,1,b[0])
				if (visy[j]) wy[j]+=minz;
		}
	}
	ans=(w[x]==v[y])?1:0;
	fo(i,1,b[0]) ans+=dis[i][linkx[i]];
	f[x][y]=ans;
}