POJ 2531-Network Saboteur(DFS)
2015-07-22 09:45
337 查看
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
Sample Output
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 9435 | Accepted: 4458 |
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
题意 :给出n个点和他们之间的权值Cij。如今要将n个点分为两部分,求∑Cij (i∈A,j∈B)最大
思路:dfs暴搜
算是没剪枝吧。。跑了219MS sad
#include <algorithm> #include <iostream> #include <cstring> #include <cstdlib> #include <string> #include <cctype> #include <vector> #include <cstdio> #include <cmath> #include <queue> #include <stack> #include <map> #include <set> #define ll long long #define maxn 360 #define pp pair<int,int> #define INF 0x3f3f3f3f #define max(x,y) ( ((x) > (y)) ? (x) : (y) ) #define min(x,y) ( ((x) > (y)) ? (y) : (x) ) using namespace std; int ma[23][23],n,ans; bool vis[23]; void dfs(int x,int num,int sum) { if(num>n/2+1)return ; int t=0; ans=max(ans,sum); for(int i=x+1;i<=n;i++) { if(!vis[i]) { vis[i]=1; int tem=sum; for(int j=1;j<=n;j++) if(vis[j]) tem-=ma[i][j]; else tem+=ma[i][j]; dfs(i,num+1,tem); vis[i]=0; } } } int main() { while(scanf("%d",&n)!=EOF) { for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&ma[i][j]); memset(vis,0,sizeof(vis)); ans=-INF; dfs(0,0,0); printf("%d\n",ans); } return 0; }
相关文章推荐
- Android在使用WebView的时候需要后退多步
- Hadoop学习笔记(准备与安装)
- php中mysql语句中如果有变量,该如何连接字符串
- MySQL 用户权限详细汇总
- 简单的天气预报信息获取
- 黑马66期android学习笔记 day1_快速入门笔记
- OFBiz + Opentaps 目录管理 四. 产品(一)定义产品 - Jason的个人空间 - 开源中国社区
- 【性能调优】Oracle AWR报告指标全解析
- hdu contest day1 1002 Assignment
- eclipse 经常loading descriptor for XXX ,然后卡死
- Linux下dmesg命令处理故障和收集系统信息的7种用法
- OC 中self. 与 下划线的区别
- PHP 获取文件上传进度
- Android中Bitmap和Drawable
- 关于网络开发中XML的使用
- 英语句子组织的5个步骤:
- ubuntu14.04-64位机配置android开发环境,ADT,sdk,eclipsea
- 服务器报错:Unable to load LSI Corporation MPT BIOS
- MFC的运行过程分析
- Ant 不是内部命令或外部命令