The nearest-one problem is defined as follows. Input: An array A

The nearest-one problem is defined as follows. Input: An array A of size n of bits; namely, the value of each entry of A is either 0 or 1. The nearest-one problem is to find for each i, 1 ≤ i ≤ n, the largest index j ≤ i, such that A(j) = 1. There is an parallel algorithm that runs in O(n) work and O(1) time for the problem. ~@[](5)

答案：FALSE