poj 2531 Network Saboteur(dfs)

题意：有n个点，把这些点分别放到两个集合里，在两个集合的每个点之间都会有权值，求可能形成的最大权值。

n<=20,数据比较弱，普通的dfs，2^n复杂度也能勉强过。。。

看网上还有用NP、随机化什么什么的。。。都不会 等学了再回过来看看吧

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 25;
int d[maxn][maxn], a[maxn], b[maxn], n, ans;

void dfs(int cur, int cnt1, int cnt2)
{
    if(cur == n+1)
    {
        int t = 0;
        for(int i = 0; i < cnt1; i++)
            for(int j = 0; j < cnt2; j++)
                t += d[a[i]][b[j]];
        ans = max(ans, t);
        return ;
    }
    a[cnt1] = cur;
    dfs(cur+1, cnt1+1, cnt2);
    b[cnt2] = cur;
    dfs(cur+1, cnt1, cnt2+1);
}

int main(void)
{
    while(cin >> n)
    {
        ans = -1;
        for(int i = 1; i <= n; i++)
            for(int j = 1; j <= n; j++)
                scanf("%d", &d[i][j]);
        dfs(1, 0, 0);
        printf("%d\n", ans);
    }
    return 0;
}

Network Saboteur

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 11937		Accepted: 5811

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

Source

Northeastern Europe 2002, Far-Eastern Subregion