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个点,以及它们之间的距离,将这些点分成两个集合,集合之间的距离为点之间的距离之和,求最大的距离。
dfs枚举所有情况就行
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#define INF 0x3f3f3f3f
#define MAXN 10005
#define Mod 10001
using namespace std;
int c[MAXN][MAXN],vis[MAXN],ans,n;
void dfs(int id,int data)
{
int tmp=data;
vis[id]=1;
for(int i=1;i<=n;++i)
{
if(vis[i]==0)
tmp+=c[id][i];
else
tmp-=c[id][i];
}
ans=max(ans,tmp);
for(int i=id+1;i<=n;++i)
{
if(tmp>data)
{
dfs(i,tmp);
vis[i]=0;
}
}
}
int main()
{
while(~scanf("%d",&n))
{
for(int i=1;i<=n;++i)
for(int j=1;j<=n;++j)
scanf("%d",&c[i][j]);
memset(vis,0,sizeof(vis));
ans=-INF;
dfs(1,0);
printf("%d\n",ans);
}
return 0;
}