☆─────────────────────────────────────☆
bigbendan (LoveforeverLong) 于 (Wed Jan 3 10:10:33 2007) 提到:
recently I just review the algorithms.
An array A[1..n] contains all the integers from 0 to n except one. It
would be easy to determine the missing integer in O(n) time by using an
auxilary array B[0..n] to record which numbers appear in A. In this
problem however we cannot access an entire integer in A with a single
operation. The elements of A are represented in binary, the only
operation
