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 |

## Is it can be solved by using the solution O(N log N)?Dynamical
at 2006-02-27 15:48:22
on Problem 2079
I find the solution O(N^2), using Graham Scan But I cannot find the solution O(N log N) Followed by:Post your reply here: |

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator