Submission #65979

---

Source Code Expand

import Control.Monad
import Text.Printf

type Point = ( Double, Double )

main = do
	n <- readLn
	points <- replicateM n $ do
		line <- getLine
		let [ x, y ] = map read $ words line
		return ( x, y )
	printf "%.6f\n" $ solve points

solve :: [ Point ] -> Double
solve points = maximum [ distance p1 p2 | p1 <- points, p2 <- points ]
	where
		distance :: Point -> Point -> Double
		distance ( x1, y1 ) ( x2, y2 ) = sqrt( dx * dx + dy * dy )
			where
				dx = x1 - x2
				dy = y1 - y2

Submission Info

Judge Result