【DFS】Network Saboteur

poj 2531 Network Saboteur

Network Saboteur

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

Output

90

题目大意

• 给你一个图，让你把这个图划分为2个部分，使得连接这两部分的边的长度之和最大，每个部分内部的边就被忽略了

思路

• DFS，因为最多20个结点，可以用暴力一点的DFS，当然还可以枚举，不过这里记录一种DFS方法
• DFS函数的两个参数：当前点和当前的值
• 从一个点开始，首先进行一次记录：遍历所有点，若已被访问，则用当前值减去当前点和这个被访问的点之间的值；若没被访问，则用当前值加上当前点和这个被访问的点之间的值。
• 然后更新一次最大值
• 如果当前值变大了，那就继续向下搜索，否则停止搜索

代码如下

#include <iostream>
#include <vector>
using namespace std;

vector<vector<int> > mp;
vector<bool> vis;
int n, max_val;

void dfs(int pstart, int val) {
    vis[pstart] = true;
    int t = val;
    for (int i = 0; i < n; i++) {
        if (vis[i])
            t -= mp[pstart][i];
        else
            t += mp[pstart][i];
    }
    max_val = max(t, max_val);
    if (t > val) {//其实这个判断写不写都行，但是写了时间会缩短到不写的1/3左右，说明还是有优化的，但只是常数级的优化，能AC就行，所以不写还简洁一些
        for (int i = pstart + 1; i < n; i++) {
            dfs(i, t);//换个起点再DFS
        }
    }
    vis[pstart] = false;
}

void solve() {
    scanf("%d", &n);
    mp.resize(n);
    vis.resize(n, false);
    for (int i = 0; i < n; i++) {
        mp[i].resize(n);
        for (int j = 0; j < n; j++) {
            scanf("%d", &mp[i][j]);
        }
    }
    dfs(0, 0);//随机选择一个点开始即可
    printf("%d\n", max_val);
}

int main(void) {
    solve();
    return 0;
}