| 摘要 |
The present invention efficiently determines the presence of a non-decreasing sequence. An aligning unit (10) generates vectors ti,i+1 and bi,i+1 wherein the elements of a set Pi have been arranged in ascending order. A merging unit (20) iterates a process wherein vectors (ti,j,bi,j) and (tj,k,bj,k) are merged so as to generate a vector (ti,k,bi,k) and thereby generates vectors t0,m and b0,m. A stable sorting unit (21) generates a vector e wherein vectors bi,j and tj,k have been concatenated and stable sorted. A searching unit (22) searches the tuple (λ,x,y) for which e[λ]is bi,j[x] and e[λ+1] is tj,k[y] and generates a set X that includes every x and a set Y that includes every y. An extracting unit (23) generates a vector ti,k wherein ti,j[x] (x∈X) has been arranged in ascending order and a vector bi,k wherein bj,k[y] (y∈Y) has been arranged in ascending order. A determining unit (30) outputs determination results that indicate that a non-decreasing sequence is not present if the length of the vector t0,m is 0. |
