 |
| ||||
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 | |||||||||
急救：这本书有没有答案的《The Design and Analysis of Computer Algorithms》A. Aho, J. Hopcroft, and J. Ullman.（附一些问题）另外问些简单题 如何用正则表达式表示 所有带奇数个a和偶数个b的字符串 证明： 1》floyd最短路径对有负权边没负环的图依然有效 2》DAG的传递规约是确定的（唯一的） 还有大家有没有听说过一个O(nloglogn)的UNION_FIND,并且可以优化到O(nlogloglogn) 给个网页，谢谢 Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator
