POJ 2531 Network Saboteur
来源:互联网 发布:菜鸟物流打印软件 编辑:程序博客网 时间:2024/05/22 10:53
Network Saboteur
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 13014 Accepted: 6270
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).
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 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
30 50 3050 0 4030 40 0
Sample Output
90
听说这道题的原做法是图论的一些高深复杂的知识,但是因为数据范围太小,所以枚举子集就可以水过。。
#include<cstdio>#include<cstring>#include<string>#include<algorithm>#include<iostream>#include<cmath>#include<queue>using namespace std;const int MAXN=25;int a[MAXN][MAXN];int A[MAXN],B[MAXN];int n;int main(){int ans=-1;scanf("%d",&n);for (int i=1;i<=n;i++){for (int j=1;j<=n;j++){scanf("%d",&a[i][j]);}}for (int k=0;k<(1<<(n-1));k++){int ret=0;memset(A,0,sizeof(A));memset(B,0,sizeof(B));int numa=1,numb=1;for (int i=1;i<n;i++){if (k&(1<<(i-1))){A[numa]=i;numa++;}else{B[numb]=i;numb++;}}A[numa]=n;numa++;for (int i=1;i<=numa;i++){for (int j=1;j<=numb;j++){ret+=a[A[i]][B[j]];}}ans=max(ret,ans);}cout<<ans; return 0;}
阅读全文
0 0
- poj 2531 Network Saboteur
- Poj 2531 Network Saboteur
- POJ 2531 Network Saboteur
- POJ 2531 Network Saboteur
- POJ 2531 Network Saboteur
- POJ-2531-Network Saboteur
- POJ 2531 Network Saboteur
- POJ 2531 Network Saboteur
- poj 2531 Network Saboteur
- POJ 2531 Network Saboteur
- POJ 2531 Network Saboteur
- poj 2531 Network Saboteur
- poj 2531: Network Saboteur
- poj 2531 Network Saboteur
- poj 2531Network Saboteur
- POJ 2531 Network Saboteur
- Network Saboteur(POJ 2531)
- Poj 2531 Network Saboteur
- Hadoop2.8.0<Mapreduce模型+shuffle过程>
- Spring boot 数据库连接断线重连
- laravel post方法请求失败
- cocos项目如何使用Android studio打包
- Ajax入门笔记
- POJ 2531 Network Saboteur
- 实现ViewPager懒加载的三种方法
- 集成 Karma 和 Jasmine 进行单元测试
- Android运行时ART执行类方法的过程分析
- iOS 计算生日转化为年龄的方法
- 手机号码验证 js input
- 剑指offer--打印1到最大n位数
- 【二】带你一起走进Activity启动模式的大门
- oracle 本地连接适配器错误无法连接plsql