摘要：用的是克鲁斯卡尔算法，跟2485差不多，也是求最小生成树中最长的一段program poj2395;type node=record x,y,c:longint; end;var a:array[1..10000] of node; father:array[1..2000] of integer; n,m,i,k,ans:longint;procedure quick(left,right:integer);var i,j,temp:longint; p:node;begin i:=left; j:=right; temp:=a[(i+j) div 2].c; while i<=j d 阅读全文

摘要：求最小生成树中最长的一段program poj2485;var a:array[1..500,1..500] of longint; d,closed:array[1..500] of longint; flag:array[1..500] of boolean; p,q,ans,n:longint;procedure init;var i,j:integer;begin fillchar(a,sizeof(a),0); readln; readln(n); for i:=1 to n do begin for j:=1 to n do read(a[i,j]); readln; end;en 阅读全文

摘要：很水的最小生成树题prim算法：program poj1258;var a:array[1..100,1..100] of longint; b:array[1..100] of longint; c:array[1..100] of integer; n,i,j:integer; ans:longint;procedure prim;var k:integer; min:longint;begin for i:=2 to n do begin b[i]:=a[1,i]; c[i]:=1; end; for i:=2 to n do begin min:=maxlongint; for j:= 阅读全文