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
Sample Output
90
题意:有n个点,把这些点分别放到两个集合里,在两个集合的每个点之间都会有权值,求可能形成的最大权值。
思路: 开一个只有0和1的值的数组,表示两个集合,先令所有点的为0,都在0集合里,然后用深搜去查询怎样的两个集合权值最大;
代码:
#include<cstdio>
#include<algorithm>
#include<cstring>
#define maxn 25
using namespace std;
int a[maxn][maxn],mark[maxn];
int n,ans;
void dfs(int x,int s)
{
mark[x]=1;
int cnt=s;
for(int i=1;i<=n;i++)
{
if(mark[i]==0)
cnt=cnt+a[x][i];
else
cnt=cnt-a[x][i];
}
if(ans<cnt)
ans=cnt;
for(int i=x+1;i<=n;i++)
{
if(cnt>s)
{
dfs(i,cnt);
mark[i]=0;
}
}
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
scanf("%d",&a[i][j]);
memset(mark,0,sizeof(mark));
ans=0;
dfs(1,0);
printf("%d\n",ans);
}
}