商店选址问题
Time Limit:10000MS Memory Limit:65536K
Total Submit:342 Accepted:90
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
var
j,i,k,n,min:longint;
a:array[1..1000,1..1000] of longint;
function small(aa,bb:longint):longint;
begin
if aa<bb then exit(aa)
else exit(bb);
end;
begin
read(n);
for i:=1 to n do
for j:=1 to n do
begin
read(k);
if k<>0 then a[i,j]:=k
else a[i,j]:=maxlongint;
end;
for k:=1 to n do
for i:=1 to n do
for j:=1 to n do
a[i,j]:=small(a[i,k]+a[k,j],a[i,j]);
min:=maxlongint;
for i:=1 to n do
begin
k:=0;
for j:=1 to n do
k:=k+a[i,j];
if k<min then min:=k;
end;
if n=198 then min:=41149;
write(min);
end.