Shiina Mashiro no youni

Masshiro na kimochi ni nate

POJ 2531 - Network Saboteur

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


题意:有这样一个集合,集合中不同元素之间有相应的值,让你将这个集合分成两个集合,使这个集合中每个元素到另一集合中所有元素的值的和最大。

直接DFS搜索即可,用 true 和 false 来标记两个集合,每次搜索看这个元素是否属于这个集合。

#include <cstdio>
#include <cstring>

int maps[25][25];
bool vis[25];
int maxn;
int n;

void solve(int step)
{
    int sum = 0;
    if (step == n)
    {
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < n; ++j)
            {
                if (vis[i] == true && vis[j] == false)
                    sum += maps[i][j];
            }
        }
        if (sum > maxn)
            maxn = sum;
        return;
    }
    vis[step] = false;
    solve(step + 1);
    vis[step] = true;
    solve(step + 1);
}

int main()
{
    scanf("%d", &n);
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            scanf("%d", &maps[i][j]);

    memset(vis, false, sizeof(vis));
    maxn = 0;
    solve(1);
    printf("%d\n", maxn);
    return 0;
}


阅读更多
版权声明:Designed by Sureina 2016©Copyright.All Right Reserved https://blog.csdn.net/Sureina/article/details/52356335
文章标签: ACM POJ
个人分类: ACM POJ
上一篇POJ 2697 - A Board Game
下一篇POJ 2406 - Power String
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭