摘要： 1005 I Think I Need a Houseboat 纯吐槽……为什么不是Nice Boat- -||| 1022 Packing Unit 4D Cubes 先Floodfill填充内部格，然后一个面构成表面的充要条件是它一侧属于方块另一侧不属于方块。 1029 False coin 根据每次操作，判断每一颗coin是否可能偏重，是否可能偏轻。然后总体判断。 1031 Fence... 阅读全文

摘要： Vol 1, 1000~1099 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 ac ac ac ac ac ac ac ac ac 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 ac ac ac ac ac ac ac ac 1020 1021 1022 1023 1024 1025 10... 阅读全文

摘要： Exercises 15.5-4 Knuth has shown that there are always roots of optimal subtrees such that root[i,j-1] root[i+1,j], then root[i+1,j](in T[i,j]) must appear in the root[i,j]'s left subtree. Since i+1's... 阅读全文

摘要： Exercises 14.2-2 Can the black-heights of nodes in a red-black tree be maintained as fields in the nodes of the tree without affecting the asymptotic performance of any of the red-black tree operation... 阅读全文

摘要： We use the following expression S(T) to show a tree T: if T is null, then S(T) is a null string if T contains only a root node, S(T) = root otherwise, let L and R are T's left and right subtrees, resp... 阅读全文

摘要： 提醒自己用1.gvim英文字体错乱/etc/vim/gvimrc去掉一下几行的注释：if has('gui_gtk2') set guifont=Monospace\ 9else set guifont=-misc-fixed-medium-r-normal--14-130-75-75-c-70-iso8859-1endif2.compiz以后标题栏消失重启Windows Decoration组件... 阅读全文

摘要： Exercises 12.1-3 Give a nonrecursive algorithm that performs an inorder tree walk. Here I give a solution that uses no stack but assumes that two pointers can be tested for equality. InorderTraverse(T... 阅读全文

摘要： Exercises 11.2-3 Professor Marley hypothesizes that substantial performance gains can be obtained if we modify the chaining scheme so that each list is kept in sorted order. How does the professor's m... 阅读全文

摘要： Exercises 10.1-7 Show how to implement a queue using two stacks. Analyze the running time of the queue operations. The amortized time is still O(1) each operation. DATA_TYPE Enqueue(DATA_TYPE data) ..... 阅读全文

摘要： Exercises 9.3-6 The k-th quantiles of an n-element set are the k-1 order statistics that divide the sorted set into k equal-sized sets (to within 1). Give an O(nlogk)-time algorithm to list the k-th q... 阅读全文