POJ2531Network Saboteur
来源:互联网 发布:java软件培训 编辑:程序博客网 时间:2024/05/29 12:29
易水人去,明月如霜。
Language:
Network Saboteur
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12905 Accepted: 6201
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
Source
Northeastern Europe 2002, Far-Eastern Subregion
最大割。
代码:
#include <cstdio>#include <iostream>#include <cstring>#include <algorithm>#include <queue>using namespace std;int map[25][25],in[25];int n;int ans;void dfs(int id,int sum){ in[id]=true; int tem=sum; for(int i=1;i<=n;i++) { if(in[i]) tem-=map[id][i]; else tem+=map[id][i]; } if(tem>ans) { ans=tem; } if(tem>sum) { for (int i = id + 1; i <= n; i++){ dfs(i, tem); } } in[id]=false ;}int main(){scanf("%d",&n);for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++) { scanf("%d",&map[i][j]); }}dfs(1,0);printf("%d",ans); return 0;}
0 0
- poj2531Network Saboteur
- POJ2531Network Saboteur
- poj2531Network Saboteur(DFS,注要是题目难明)
- pku2531Network Saboteur
- poj2531_Network Saboteur
- Network Saboteur
- Network Saboteur
- POJ2531___Network Saboteur
- Network Saboteur
- Network Saboteur
- Network Saboteur
- Network Saboteur
- poj 2531 Network Saboteur
- Poj 2531 Network Saboteur
- K - Network Saboteur
- POJ 2531 Network Saboteur
- poj2531 Network Saboteur
- POJ 2531 Network Saboteur
- C语言学习之1(Microsoft Visual Studio即VC6软件的安装及hello world 简单例子编写)
- [jQuery知识]jQuery之知识十一-动画高级
- Java搞基IO流的基础二三事之二
- 护照阅读机出入境运用SDK
- [jQuery知识]jQuery之知识十二-Ajax初级
- POJ2531Network Saboteur
- 微软人脉应用获得Project NEON界面重大更新
- Scroller解析
- WSDL返回值处理
- tomcat的配置与java环境变量的的矛盾
- [jQuery知识]jQuery之知识十三-Ajax中级
- [jQuery知识]jQuery之知识十四-Ajax高级
- HEOI 2012 旅行问题 BZOJ2746
- jdbc连接数据库基本步骤以及错误总结