POJ 2758 - Checking the Text

Desctription: An initial length 50000 string. At most 200 insertion (one character each), at most 20000 query. The query is to find the lcp of two sufix.

Solution: Since the insertion is at most 200, we can split the query into at most rmq (The match based on sufix array will be blocked at the insertion point). Thus we need to construct tags to indicate the insertion point, the latest insertion point from the query point, etc.

Status: 1. WA first - When insertion, it should be guaranteed that the bidirectional reflection between original string position and current string position is correct. I forgot to give the initial value of the reflection from new inserted character, which interupt the original string.
	2. AC