Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

an O(n^2) way

Posted by frkstyc at 2005-10-15 00:19:44
In Reply To:Re:an almost brute-force way would do Posted by:griffon at 2005-10-15 00:17:42

> Please tell me what you mean by bruteforce?

Followed by:

Re:an O(n^2) way (44) griffon 2005-10-15 01:11:21
- You said this not having made any attempt, didn't you? (48) frkstyc 2005-10-15 01:43:40
- If you find line a and line b intersect in a point, the line below can be ignore in later's search. So,much less than n^2. (48) piaoxing176 2005-10-15 01:45:53

Post your reply here:

Home Page Go Back To top

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator