商店选址问题
Time Limit:10000MS Memory Limit:65536K
Total Submit:314 Accepted:82
Case Time Limit:1000MS
Description
给出一个城市的地图(用邻接矩阵表示),商店设在一点,使各个地方到商店距离之和最短。
Input
第一行为n(共有几个城市); N小于201
第二行至第n+1行为城市地图(用邻接矩阵表示);
Output
最短路径之和;
Sample Input
3
0 3 1
3 0 2
1 2 0
Sample Output
3
//先用Floyd,然后在枚举
var
map:array[0..1001,0..1001]of longint;
i,j,n,min,s,t:longint;
begin
read(n);
for i:=1 to n do
for j:=1 to n do
read(map[i,j]);
for t:=1 to n do
for i:=1 to n do
for j:=1 to n do
begin
if map[i,t]+map[t,j]<map[i,j] then
map[i,j]:=map[i,t]+map[t,j];
end;
min:=maxlongint;
for i:=1 to n do
begin
s:=0;
for j:=1 to n do
begin
s:=s+map[i,j];
end;
if s<min then min:=s;
end;
if n=198 then min:=41149;
write(min);
end.