zoj 1586 QS Network(最小生成树))
来源:互联网 发布:无线电收音软件 编辑:程序博客网 时间:2024/06/04 18:11
In the planet w-503 of galaxy cgb, there is a kind of intelligent creature named QS. QScommunicate with each other via networks. If two QS want to get connected, they need to buy two network adapters (one for each QS) and a segment of network cable. Please be advised that ONE NETWORK ADAPTER CAN ONLY BE USED IN A SINGLE CONNECTION.(ie. if a QS want to setup four connections, it needs to buy four adapters). In the procedure of communication, a QS broadcasts its message to all the QS it is connected with, the group of QS who receive the message broadcast the message to all the QS they connected with, the procedure repeats until all the QS's have received the message.
A sample is shown below:
A sample QS network, and QS A want to send a message.
Step 1. QS A sends message to QS B and QS C;
Step 2. QS B sends message to QS A ; QS C sends message to QS A and QS D;
Step 3. the procedure terminates because all the QS received the message.
Each QS has its favorate brand of network adapters and always buys the brand in all of its connections. Also the distance between QS vary. Given the price of each QS's favorate brand of network adapters and the price of cable between each pair of QS, your task is to write a program to determine the minimum cost to setup a QS network.
Input
The 1st line of the input contains an integer t which indicates the number of data sets.
From the second line there are t data sets.
In a single data set,the 1st line contains an interger n which indicates the number of QS.
The 2nd line contains n integers, indicating the price of each QS's favorate network adapter.
In the 3rd line to the n+2th line contain a matrix indicating the price of cable between ecah pair of QS.
Constrains:
all the integers in the input are non-negative and not more than 1000.
Output
for each data set,output the minimum cost in a line. NO extra empty lines needed.
Sample Input
1
3
10 20 30
0 100 200
100 0 300
200 300 0
Sample Output
370
QS是一种生物,要完成通信,需要设备,每个QS需要的设备的价格不同,并且,这种设备只能在两个QS之间用一次,也就是说,如果一个QS需要和3个QS通信的话,它就必须得买3个设备,同时,对方三个也必须买对应的适合自己的设备。同时,每两个QS之间是有距离的,要完成通信还需要网线,给出每两个QS之间的网线的价值。求一棵生成树,使得所需要的费用最少。
#include <iostream>#include <algorithm>using namespace std;int Edge[1010][1010];int lowcost[1010]; //prim算法中两个数组合并使用int adapter[1010]; //网络适配器价格int t,n;void prim(){ int sum=0; for (int i=0; i<n; i++) { lowcost[i]=Edge[0][i]; } lowcost[0]=-1; //标记已选择顶点 int k=0; for (int i=1; i<n; i++) //n-1次选择 { int min=100000; for (int j=0; j<n; j++) { if(lowcost[j]!=-1 && lowcost[j]<min) { k=j; min=lowcost[j]; } } sum+=min; lowcost[k]=-1; for (int j=0; j<n; j++) { if(Edge[k][j]<lowcost[j]) { lowcost[j]=Edge[k][j]; } } } cout<<sum<<endl;}int main(){ cin>>t; while (t--) { cin>>n; for (int i=0; i<n; i++) { cin>>adapter[i]; } for (int i=0; i<n; i++) { for (int j=0; j<n; j++) { cin>>Edge[i][j]; if(i==j) { Edge[i][j]=100000; } else { Edge[i][j]+=adapter[i]+adapter[j]; //网线费用加上网络适配器费用。 } } } prim(); } return 0;}
- ZOJ QS Network(最小生成树)
- zoj 1586 QS Network(最小生成树))
- zoj 1586 QS Network (最小生成树)
- ZOJ - 1586 QS Network (最小生成树 Kruskal)
- ZOJ 1586 QS Network(最小生成树)
- ZOJ 1586 QS Network(最小生成树)
- ZOJ-1586-QS Network(最小生成树 普利姆)
- zoj 1586 QS Network 最小生成树
- 【最小生成树】QS Network ZOJ 1586
- ZOJ 1586 QS Network 最小生成树
- zoj 1586 QS Network(最小生成树)
- QS Network 【zoj-1586】【最小生成树】
- ZOJ 1586 QS Network(最小生成树)
- ZOJ-1586 QS Network (最小生成树)
- ZOJ 1586&&FZU 1096 QS Network(kuangbin带你飞 专题六 最小生成树)
- ZOJ 1586 QS Network 最小生成树水题
- zoj1586 QS Network(最小生成树)
- QS Network(最小生成树)
- c++字符串操作函数
- Linux下查看文件和文件夹大小
- 解决CC2540 XDATA内存不足
- [1145]面向对象程序设计上机练习六(类和对象)
- PHP读取文件中文乱码UTF-8;
- zoj 1586 QS Network(最小生成树))
- 电脑没有运行Windows无线服务解决办法
- Adidas鞋 t7Fd cE7 oCiUa
- 移动WEB测试工具 Adobe Edge Inspect
- 紐巴倫專賣 JE9d VCk NIHLK
- 遍历Map的四种方法
- iPhone升级ios8数据丢失怎么恢复
- Java Integer类的缓存
- InitCommonControlsEx