作业帮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;beginif a>b t
来源：学生作业帮助网 编辑：作业帮 时间：2024/04/28 06:41:48
![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;beginif a>b t](/uploads/image/z/15086592-0-2.jpg?t=2010niop%E6%99%AE%E5%8F%8A%E7%BB%84%E5%A4%8D%E8%B5%9B%E5%AF%BC%E5%BC%B9%E6%8B%A6%E6%88%AA+%E8%AF%B7%E9%AB%98%E6%89%8B%E5%B8%AE%E6%88%91%E6%A3%80%E6%B5%8B%E6%88%91%E8%BF%99%E9%81%93%E9%A2%98%E6%98%AF%E5%90%A6%E6%AD%A3%E7%A1%AE%EF%BC%88%E7%A8%8B%E5%BA%8F%E6%9C%89%E6%B2%A1%E9%94%99%2C%E6%97%B6%E9%97%B4%E6%9C%89%E6%B2%A1%E8%B6%85%EF%BC%89var+x1%2Cx2%2Cy1%2Cy2%2Ci%2Cj%2Cans1%2Cans2%2Cn%3Alongint%3Ba%3Aarray%5B1..100000%2C1..2%5D+of+integer%3Bc%3Aboolean%3Bfunction+min%28a%2Cb%3Alongint%29%3Alongint%3Bbeginif+a%3Eb+t)
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;beginif a>b t
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.
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;beginif a>b t
看的不是太懂.一楼很好笑啊,自己找数据￥
自己找测试数据测啊