Submission #2696761

---

Source Code Expand

n = gets.chomp.to_i
ary = []
n.times do
  ary << gets.chomp.split.map(&:to_i)
end
max_length_square = 0
for i in 0..(n-2) do
  for j in (i+1)..(n-1) do
    tmp_length_square = (ary[i][0]-ary[j][0])**2+(ary[i][1]-ary[j][1])**2
    max_length_square = [max_length_square,tmp_length_square].max
  end
end
puts max_length_square**(1/2.0)

Submission Info

Judge Result