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 |
键树做成26叉树应该是会超内存的,所以把键树作成“兄弟-孩子”的二叉树就好了。In Reply To:咱也正想做这题,不是 暴搜加优化就能过吧 Posted by:semonteer at 2006-02-28 19:01:19 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator