1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
|
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define MAXN 510
#define INF 0x3f3f3f3f
int t, n, ans;
int lowcost[MAXN];
int vis[MAXN];
int mp[MAXN][MAXN];
void init()
{
memset(vis, 0, sizeof(vis));
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
mp[i][j] = INF;
}
}
}
void prime()
{
int pos;
ans = 0;
vis[1] = 1;
for(int i = 1; i <= n; i++){
lowcost[i] = mp[1][i];
}
for(int i = 1; i <= n; i++){
pos = -1;
for(int j = 1; j <= n; j++)if(!vis[j] && (pos == -1 || lowcost[j] < lowcost[pos])){
pos = j;
}
if(pos == -1)
break;
vis[pos] = 1;
if(ans < lowcost[pos])
ans = lowcost[pos];
for(int j = 1; j <= n; j++)if(!vis[j] && lowcost[j] > mp[j][pos]){
lowcost[j] = mp[j][pos];
}
}
printf("%d\n", ans);
}
int main()
{
int tmp;
scanf("%d", &t);
while(t--){
scanf("%d", &n);
init();
for(int i = 1; i <= n; i++){
for(int j = 1; j <= n; j++){
scanf("%d", &tmp);
if(tmp < mp[i][j])
mp[i][j] = mp[j][i] = tmp;
}
}
prime();
}
return 0;
}
|
