Complexity

We say that a block B is prime, if it contains all blocks ending at Last(B). We define $C_p=\frac {1}{n}\sum \limits _{{\rm prime~}B}{\rm size}(B)$, and denote the number of blocks by b, then the complexity of the algorithm is $O(m\cdot n\cdot C_p +m\cdot b)$ both for time and space. The space complexity can be reduced using the Hirchberg method.