hdu3435 A new Graph Game (KM)

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3435

题解：见http://blog.csdn.net/lezg_bkbj/article/details/11395005

#include <stdio.h>        
#include <string.h>       
#include <math.h>      
#define INF 0x3f3f3f3f    
#define MAXN 1002 

int w[MAXN][MAXN],match[MAXN],n;      
int lx[MAXN],ly[MAXN],slack[MAXN];      
int visitx[MAXN],visity[MAXN];    

int Scan()          
{          
	char ch;          
	int ret=0;          
	while((ch=getchar())<'0'||ch>'9');          
	while(ch>='0'&&ch<='9')          
	{          
		ret=ret*10+(ch-'0');          
		ch=getchar();          
	}          
	return ret;          
}      

int find(int x)    
{    
	int i,temp;    
	visitx[x]=1;    
	for(i=1;i<=n;++i)    
	{    
		if(visity[i])    
			continue;    
		temp=lx[x]+ly[i]-w[x][i];    
		if(temp==0)    
		{    
			visity[i]=1;    
			if(match[i]==-1||find(match[i]))    
			{    
				match[i]=x;//找到增广轨    
				return 1;    
			}    
		}    
		else if(slack[i]>temp)    
		{//不在相等子图中slack 取最小的    
			slack[i]=temp;    
		}    
	}    
	return 0;    
}    

void KM()    
{    
	int i,j,d;    
	memset(ly,0,sizeof(ly));    
	memset(match,-1,sizeof(match));    
	for(i=1;i<=n;++i)    
	{//lx初始化为与它关联边中最大的     
		lx[i]=w[i][1];    
		for(j=2;j<=n;++j)    
			if(w[i][j]>lx[i])    
				lx[i]=w[i][j];    
	}    
	for(i=1;i<=n;++i)    
	{    
		for(j=1;j<=n;++j)    
			slack[j]=INF;    
		while(1)    
		{    
			memset(visitx,0,sizeof(visitx));    
			memset(visity,0,sizeof(visity));    
			if(find(i))    
				break;    
			d=INF;    
			for(j=1;j<=n;++j)    
			{    
				if(!visity[j]&&d>slack[j])    
					d=slack[j];    
			}    
			for(j=1;j<=n;++j)    
			{    
				if(visitx[j])    
					lx[j]-=d;    
				if(visity[j])    
					ly[j]+=d;    
				else    
					slack[j]-=d;    
			}    
		}    
	}    
}   

int main()  
{  
	int u,v,W,m,test,ans,flag,cases=1;  
	scanf("%d",&test);  
	while(test--)  
	{  
		//n=Scan();  
		//m=Scan(); 
		scanf("%d %d",&n,&m);
		for(v=0;v<=n;++v)  
		{  
			for(u=0;u<=n;++u)  
				w[v][u]=~INF+1;  
		}  
		while(m--)  
		{  
			u=Scan();  
			v=Scan();  
			W=Scan();  
			W=~W+1;//取反  
			if(W>w[u][v])  
				w[u][v]=W; 
			if(W>w[v][u])
				w[v][u]=W;
		}  
		KM();  
		ans=0;
		flag=1;
		for(v=1;v<=n;++v)  
		{  
			if(match[v]==-1||w[match[v]][v]==(~INF+1))
			{
				flag=0;
				break;
			}
			ans+=w[match[v]][v];  
		}  
		if(flag)
		    printf("Case %d: %d\n",cases++,~ans+1); 
		else
			printf("Case %d: NO\n",cases++);
	}  
	return 0;  
}