 |
| ||||
Home Page
F.A.Qs
Statistical Charts
Past Contests
Scheduled Contests
Award Contest
| ||||||||||
| 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 | |||||||||
唉呀，我老老实实地照着fhq的题解写了树的分治，比原来DFS递推快，可是仍然TLEIn Reply To:这题有没有人写的O(n*sqrt(n)*logn)的DFS序递推，我优化半天死活TLE Posted by:bg95 at 2012-01-28 12:38:43 我不行了……对拍过了，不做这题了…… Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
