2010niop普及组复赛导弹拦截请高手帮我检测我这道题是否正确（程序有没错,时间有没超）varx1,x2,y1,y2,i,j,ans1,ans2,n:longint;a:array[1..100000,1..2]ofinteger;c:boolean;functionmin(a,b:longint):longint;beginifa>bt

Question

2010niop普及组复赛导弹拦截 请高手帮我检测我这道题是否正确（程序有没错,时间有没超）
var x1,x2,y1,y2,i,j,ans1,ans2,n:longint;
a:array[1..100000,1..2] of integer;
c:boolean;
function min(a,b:longint):longint;
begin
if a>b then min:=b
else min:=a;
if min=b then c:=false;
end;
function max(a,b:longint):longint;
begin
if a>b then max:=a
else max:=b;
end;
function ju(a1,a2,b1,b2,c1,c2:integer):longint;
var q,p:longint;
begin
q:=(a1-b1)*(a1-b1)+(a2-b2)*(a2-b2);
p:=(a1-c1)*(a1-c1)+(a2-c2)*(a2-c2);
ju:=min(q,p);
end;
begin
read(x1,x2,y1,y2);//此处定义与题目不同,认真看
read(n);
for i:=1 to n do
begin
c:=true;
read(a[i,1],a[i,2]);
j:=ju(a[i,1],a[i,2],x1,x2,y1,y2);
if c then ans1:=max(ans1,j)
else ans2:=max(ans2,j);
end;
write(ans1+ans2);
end.

Answer 1

看的不是太懂.一楼很好笑啊,自己找数据￥