POJ2531---Network Saboteur（dfs）

                                                      Network Saboteur

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 15961		Accepted: 7935

Description

A university network is composed of N computers. System administrators gathered information on the traffic between nodes, and carefully divided the network into two subnetworks in order to minimize traffic between parts. 
A disgruntled computer science student Vasya, after being expelled from the university, decided to have his revenge. He hacked into the university network and decided to reassign computers to maximize the traffic between two subnetworks. 
Unfortunately, he found that calculating such worst subdivision is one of those problems he, being a student, failed to solve. So he asks you, a more successful CS student, to help him. 
The traffic data are given in the form of matrix C, where Cij is the amount of data sent between ith and jth nodes (Cij = Cji, Cii = 0). The goal is to divide the network nodes into the two disjointed subsets A and B so as to maximize the sum ∑Cij (i∈A,j∈B).

Input

The first line of input contains a number of nodes N (2 <= N <= 20). The following N lines, containing N space-separated integers each, represent the traffic matrix C (0 <= Cij <= 10000). 
Output file must contain a single integer -- the maximum traffic between the subnetworks. 

Output

Output must contain a single integer -- the maximum traffic between the subnetworks.

Sample Input

3
0 50 30
50 0 40
30 40 0

这道题题目不长  看似不难，但是读不懂题目最致命

题目大意：给你n个点，并通过（邻接矩阵）给出任意两点之间的距离，让你把这n个点分成两部分A  B，目标是让A中的点到B中所有点的距离之和再求和 最大 ，即求 max(∑（A中的点到B中所有点的距离之和）)，确实很饶人，其实这是一个最大割问题

弄懂题意就可以枚举了，我们先把所有的点放在一个集合里面，然后逐渐的拿出来组成另一个集合（使用book数组标记），在枚举的过程中更新所求的最大值，注意交换集合时的数值变换

可以利用一个小剪枝，当加入了一个点使得目标数值变小之后，那么这个点是不符合要求的，就没有必要再去枚举了，其实没有剪枝也能莽的过去

#include<cstdio>
#include<string>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#define ll long long
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
inline int _read() {
    char ch = getchar();
    int sum = 0;
    while (!(ch >= '0' && ch <= '9'))ch = getchar();
    while (ch >= '0' && ch <= '9')sum = sum * 10 + ch - 48, ch = getchar();
    return sum;
}
const int inf=0x3f3f3f3f;
const int mm=22;

int n;
int book[mm];
int mp[mm][mm];
int res; 

void dfs(int k,int sum){//枚举第k个点 当前距离为sum
	int num=sum;
	for(int i=1;i<=n;i++)//求出加入k后的sum 
		if(book[i]) 
			num-=mp[k][i];// 同一个集合 减去 
		else 
			num+=mp[k][i];//另一个集合 加上  
	if(num>res)	
		res=num;//更新res  
	for(int i=k+1;i<=n;i++)//尝试加入其它点  
		if(num>sum){//小剪枝  
		 	book[i]=1;
		 	dfs(i,num);
		 	book[i]=0;
	 	}	
}

int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			scanf("%d",&mp[i][j]);
	res=-inf;
	book[1]=1;
	dfs(1,0);
	printf("%d\n",res);

	return 0;
}