POJ 2531 Network Saboteur （dfs+水题）

最新推荐文章于 2018-09-26 12:26:34 发布

lwgkzl

最新推荐文章于 2018-09-26 12:26:34 发布

阅读量373

点赞数

分类专栏： # 深度优先搜索 # 水题文章标签： dfs poj

本文链接：https://blog.csdn.net/lwgkzl/article/details/53247494

版权

水题同时被 2 个专栏收录

17 篇文章 0 订阅

订阅专栏

深度优先搜索

4 篇文章 0 订阅

订阅专栏

Network Saboteur

Time Limit: 2000MS

Memory Limit: 65536KB

64bit IO Format: %lld & %llu

Submit Status

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

Sample Output

无需多说，这么小的数据量，直接爆搜。。。对于每一个数进行两种判断，一种放到第一个集合里，一种放到第二个集合里。

代码如下：

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int INF=1<<30;
int  flag[25],fl[25];
int n;
int cun[25][25];
int sum=-INF;

void dfs(int deep,int tr,int fa)
{
       int res=0;
    if(deep==n)
    {
       for(int  i=0;i<tr;i++)
        {
            for(int j=0;j<fa;j++)
            {
                int a=flag[i],b=fl[j];
res+=cun[a][b];
            }
        }
sum=max(sum,res);
return ;
    }
flag[tr]=deep;
dfs(deep+1,tr+1,fa);
fl[fa]=deep;
dfs(deep+1,tr,fa+1);
}

int main(){
cin>>n;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin>>cun[i][j];
dfs(0,0,0);
cout<<sum<<endl;
return 0;}