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 |
这题,,哭了。。。。先想了个图论重连通的搞法n^3,不知道为啥,wa了。。然后。。。暴力hash,,又wa。。再然后,用了个n*p*logp的区间合并,tle。。再然后,发现暴力hash有个地方错了,改了下,1000MS过了,不知道该说啥好了-_- 我想说的重点是:为什么nplogp的算法过不去,n*n*p的hash反倒能过。。是不是数据太侧重小区间了-_- ps:求n*p的搞法。。最好详细点,谢谢^_^ Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator