Network Saboteur(dfs)
来源:互联网 发布:gopro 软件 编辑:程序博客网 时间:2024/05/17 23:24
Problem 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). <br>Output file must contain a single integer -- the maximum traffic between the subnetworks. <br>
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
//What fuck!!!!? //分成两组 求第一组的每一个点到第二个组的每一个点的距离的最大值是多少 //刚开始都是在第二组, 没有被标记的一组 #if 0 //Network Saboteur #include<iostream>#include<cstring>using namespace std;bool vis[25];int map[25][25],maxx,n;void dfs(int x,int sum){int mx=sum;vis[x]=1;for(int j=0; j<n; j++){if(vis[j]==0){mx+=map[x][j];}else{mx-=map[x][j];}}if(mx>maxx)maxx=mx;if(mx>sum){for(int k=x+1; k<n; k++){dfs(k,mx);vis[k]=0;}}}int main(){cin>>n;for(int i=0; i<n; i++){for(int j=0; j<n; j++){cin>>map[i][j];}}dfs(0,0);cout<<maxx<<endl;}#endif
阅读全文
0 0
- DFS-Network Saboteur
- POJ2531 Network Saboteur dfs
- Network Saboteur--dfs
- Network Saboteur(dfs)
- poj 2531 Network Saboteur (dfs)
- poj 2351 Network Saboteur DFS
- poj 2531 Network Saboteur (dfs)
- Network Saboteur (poj 2531 dfs)
- POJ 2531 Network Saboteur(DFS)
- poj-2531 Network Saboteur DFS
- POJ -2531-Network Saboteur-DFS
- DFS Network Saboteur poj 2531
- 【Poj 2531】 Network Saboteur dfs
- [POJ 2531]Network Saboteur[DFS]
- POJ-2531 Network Saboteur (DFS)
- poj-dfs-2531Network Saboteur
- poj 2531 Network Saboteur(dfs)
- Network Saboteur(dfs+剪枝)
- 小狼毫输入法0.9-安装配置
- AJAX知识总结
- ubuntu安装未知笔记
- GNS3搭建小型局域网并连接互联网
- 简单的几招,再没人能蹭你家wifi
- Network Saboteur(dfs)
- OpenResty普通模块与实例化模块
- 实习心得-链家网
- Python 快速入门
- 【jzoj5231】【NOIP2017模拟A组模拟8.5】【序列问题】 【分治】
- 欢迎使用CSDN-markdown编辑器
- pip国内源
- openfire+XMPP实现即时通讯
- 练习 2-1 编写一个程序以确定分别由signed及unsigned 限定的char、short、int与long类型变量的取值范围。采用打印标准头文件中的相应值以及直接计算两种方式实现