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 |
Re:复杂度是O((n+m)log2(n+m))的In Reply To:Re:实际上就是对y按递增排序,y相等则按x递减排序,然后求x的逆序数,可以用归并解决了。 Posted by:Thank_you at 2007-08-15 10:20:58 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator