DFS-Network Saboteur
来源:互联网 发布:电信网络电视怎么收费 编辑:程序博客网 时间:2024/06/06 01:14
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
90code:<span style="font-size:18px;">#include <iostream>#include<algorithm>#include<string.h>#include<stdio.h>#include<math.h>using namespace std;const int MAX=25;int a[MAX][MAX],mark[MAX],total=0,ans=0;int n;void dfs(int i){ if(i==n-1){ total=0; for(int i=0;i<n;i++) for(int j=0;j<n;j++){ if(mark[i]&&! mark[j]){ total+=a[i][j]; } } ans=total>ans?total:ans; return; } mark[i]=1; dfs(i+1); mark[i]=0; dfs(i+1);}int main(){ // freopen("input.txt","r",stdin); cin>>n; for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>a[i][j]; memset(mark,0,n); dfs(0); cout<<ans<<endl; return 0;}</span>
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+剪枝)
- Android 高仿QQ 好友分组列表
- auto.offset.reset 说明
- nginx配置信息的解析流程
- 深度学习的背景
- 度量学习(Distance Metric Learning)介绍
- DFS-Network Saboteur
- 安装Ruby环境和下载和安装CocoaPods
- springmvc 异常处理、文件上传以及拦截器相关知识
- 类模板的小结理论篇(转)
- Promise实现原理
- VC实现显示文件复制的进度
- javascript深入理解js闭包
- 部分安卓机型 页面无法跳转
- 349. Intersection of Two Arrays