POJ-2531 dfs+剪枝

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.StreamTokenizer;
import java.util.Arrays;

/*
 * 分为两个集合0和1，每个元素尝试加入集合1。
 */

public class Main_POJ2531 {
	static int n,res;
	static int[][] C = new int[25][25];
	static int[] vis = new int[25];
	public static void main(String[] args) throws IOException {
		StreamTokenizer sc = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		sc.nextToken();
		n = (int)sc.nval;
		for(int i=1;i<=n;i++) {
			for(int j=1;j<=n;j++) {
				sc.nextToken();
				C[i][j] = (int)sc.nval;
			}
		}
		Arrays.fill(vis, 0);
		res = -1;
		vis[1] = 1;   //加入集合1
		dfs(1,0);
		System.out.println(res);
	}
	public static void dfs(int k,int sum) {
		int num = sum;
		//求得k加入集合1后的结果
		for(int i=1;i<=n;i++) { 
			if(vis[i]==1)   //如果与k属于相同的集合就减去
				num -= C[k][i];
			else
				num += C[k][i];
		}
		if(num>res)
			res = num;
		if(num<=sum) return;  //如果加入k的结果更小了就不必再搜下去了
		for(int i=k+1;i<=n;i++) {
			vis[i] = 1;    //加入集合1
			dfs(i,num);
			vis[i] = 0;    //回溯
		}
	}
}