 |
| ||||
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 | |||||||||
可以用刘汝佳书上说的改变两个相邻的顺序不影响前面和后面的结果来证明，这样只要讨论当前两个的位置就可以了。In Reply To:Re:是不是常规做法需要那么多？现在过得都是不常规的？或者说理论上未必正确的算法？ Posted by:atlas_of_rruucc at 2004-07-24 00:43:23 > 常规做法就是HASH+搜索+剪枝，用HASH当然需要很多，6K应该是必须的了； > 现在过的那种算法不一定就有问题，明天想想应该怎么证明 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
