最小生成树专题

今天系统的做了一下有关最小生成树的题目，都挺水的，水水更健康嘛
1.hdu1233，中文题目，不再赘述了，很裸的MST

import java.util.Arrays;
import java.util.Scanner;

public class hdu1233 {
static int roadnum;
static int max=10010;
static int parent[]=new int[max];
static road ro[];

static void init()
{
	for(int i=0;i<max;i++)
	{
		parent[i]=i;
	}
}

static int find(int x)
{
	if(x!=parent[x])
		parent[x]=find(parent[x]);
	return parent[x];
}

static void union(int fa,int fb)//没有按秩归并，速度稍有点差
{
	parent[fa]=fb;
}

static int kruskal() 
{
	int ans=0,i,j;
	init();
	for(i=0;i<roadnum;i++)
	{
		int fa=find(ro[i].start);
		int fb=find(ro[i].end);
		if(fa!=fb)
		{
			ans+=ro[i].value;
			union(fa,fb);
		}
	}
	
	
	return ans;
	
}
public static void main(String[] args) {
	
	Scanner in=new Scanner(System.in);
	int number;
	while((number=in.nextInt())!=0)
	{
		roadnum=number*(number-1)/2;
		ro=new road[roadnum];
		for(int i=0;i<roadnum;i++)
		{
			ro[i]=new road();
			ro[i].start=in.nextInt();
			ro[i].end=in.nextInt();
			ro[i].value=in.nextInt();
		}
		Arrays.sort(ro);
		
		System.out.println(kruskal());
		
	}
	
	
}

}
class road implements Comparable<road>
{
	int start,end;
	int value;
	@Override
	public int compareTo(road o) {
		if(this.value<o.value)
			return -1;
		else
			return 1;
	}
}

2.hdu1875，还是中文题目，ps： 你可以看出来我的e文很水了吧， 题目直接给出的坐标，特别注意在比较的时候是要dis>=10.000000&&dis<=1000.000001

import java.util.Arrays;
import java.util.Scanner;

//prim
public class hdu1875 {

	static int maxnum=10100;
	static int MAX=100000000;
	static int Nodenum;
	static double map[][];
	static int used[]=new int[maxnum];
	static double dis[]=new double[maxnum];
	static roads data1[];

	static double prim()
	{
		double ans=0;
		double min;
		int now,i,j;
		Arrays.fill(used, 0);
		Arrays.fill(dis, MAX);
		now=1;
		used[now]=1;
		dis[now]=0;
		
		for(i=1;i<Nodenum;i++)
		{
			for(j=1;j<=Nodenum;j++)
			{
				if(used[j]==0&&dis[j]>map[now][j])
					dis[j]=map[now][j];
			}
			
			min=MAX;
			
			for(j=1;j<=Nodenum;j++)
			{
				if(used[j]==0&&min>dis[j])
					min=dis[now=j];
			}
			used[now]=1;
			ans+=min;
			
		}
		
		return ans;
	}
	static double caldis(roads r1,roads r2)
	{
		double tem1=Math.abs(r2.x-r1.x)*Math.abs(r2.x-r1.x);
		double tem2=Math.abs(r2.y-r1.y)*Math.abs(r2.y-r1.y);
		double ans=Math.sqrt(tem1+tem2);
		return ans;
	}

		public static void main(String[] args) {
			Scanner in=new Scanner(System.in);
			int casenum=in.nextInt();
			while(casenum--!=0)
			{
				Nodenum=in.nextInt();
				map=new double[Nodenum+1][Nodenum+1];
				data1=new roads[Nodenum+1];
				for(int i=1;i<=Nodenum;i++)
				{
					double x=in.nextDouble();
					double y=in.nextDouble();
					data1[i]=new roads(x,y);
				}
				int flag=0;
				
				for(int i=1;i<=Nodenum;i++)
					map[i][i]=0;
				for(int i=1;i<=Nodenum;i++)
				{
					for(int j=i+1;j<=Nodenum;j++)
					{
						double temp=caldis(data1[i],data1[j]);
						if(temp>=10.000000&&temp<=1000.000001)
						{
							flag++;
							map[j][i]=map[i][j]=temp;
						}else
						{
							map[j][i]=map[i][j]=MAX;
						}
					}
				}
				
				if(Nodenum==0||flag<Nodenum-1)
				{
					System.out.println("oh!");
				}else
				{
					System.out.printf("%.1f",(double)100*prim());
					System.out.println();
				}
			}
		}
}
class roads
{
	
	double x,y;
	roads(double x,double y)
	{
		this.x=x;
		this.y=y;
	}
	
}

3.zoj1586 题意简化后是说给出一些点权和边权，求最小生成树的权值就是所有经过的点权加上边权

可以转化思路，直接将每条边的起点和终点的点权加到边权上然后直接求最小生成树就可以了

import java.util.Arrays;
import java.util.Scanner;

public class zoj1586 {
	static int maxnum = 10100;
	static int MAX = 100000000;
	static int Nodenum;
	static int map[][];
	static int used[] = new int[maxnum];
	static int dis[] = new int[maxnum];
	static int favor[] = new int[maxnum];

	static int prim() {
		int ans = 0;
		int min, now, i, j;
		Arrays.fill(used, 0);
		Arrays.fill(dis, MAX);
		now = 1;
		used[now] = 1;
		dis[now] = 0;

		for (i = 1; i < Nodenum; i++) {
			for (j = 1; j <= Nodenum; j++)// 注意此处是小于等于Nodenum
			{
				if (used[j] == 0 && dis[j] > map[now][j]) {
					dis[j] = map[now][j];
					
				}
			}

			min = MAX;

			for (j = 1; j <= Nodenum; j++) {
				if (used[j] == 0 && min > dis[j]) {
					min = dis[now = j];
//					System.out.println(min + "&*&*&*&" + favor[j]);
				}
			}
			used[now] = 1;
			ans += min;

		}

		return ans;
	}

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int casenum=in.nextInt();
		while (casenum--!=0) {
			Nodenum = in.nextInt();
			for (int i = 1; i <= Nodenum; i++)
				favor[i] = in.nextInt();
			map = new int[Nodenum + 1][Nodenum + 1];
			for (int i = 1; i <= Nodenum; i++)
				for (int j = 1; j <= Nodenum; j++) {
					map[i][j] = in.nextInt()+favor[i]+favor[j];
				}
			
			System.out.println(prim());

		}
	}

}

未完待续。。。。。

更多题目在：

http://acm.hust.edu.cn:8080/judge/contest/view.action?cid=11011#overview