Improvements-on-the- Range-- Minimum-- Query-- Problem课件.pptVIP

Answering In-block-queries Number of unlabelled bin. trees with n nodes: n’th Catalan number Cn Cn=O(4n/n3/2) Theorem: We can store answers to all in-block-queries in space O(n) Proof: O(4s/s3/2)·s2 = O(22s·s1/2) = O(2log(n)/2·log1/2n) = O(n1/2·log1/2n) * Answering In-block-queries One problem remains: For each block Bi we need to know its type in time O(s) Type: bijection t from arrays of size s to {0,…,Cs-1} with t(B)= t(B’) iff B and B’ have same Cartesian Tree build Cartesian Tree for each block Bj give tree a number 0 ≤ t(Bj) Cs * O(n)-Algo for Cartesian Tree Let Ti be the Cartesian Tree for B[1,i] Ti obtained from Ti-1 as follows: x y B[x] ≤ B[i] B[i] x i y ? * J. Fischer, V.Heun: Improvements on the RMQ-Problem * . . * . . * . . * . . for suffixes ti..n and ti‘..n return max{k : ti..k = ti‘..k} * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . * . . Improvements on theRange-Minimum-Query-Problem Johannes Fischer Volker Heun Universit?t München, Institut für Informatik * Introduction * Introduction given: array A of size n Task: preprocess A such that RMQA(l,r) = argminl≤i≤r A[i] can be answered efficiently l r min ? return 5 1 2 3 4 5 6 7 8 9 10 11 A = 2 5 2 4 1 7 5 8 3 8 6 Break ties to the left 1 2 3 4 5 6 7 8 9 10 11 A = 2 5 2 4 1 7 5 8 3 8 6 1 2 3 4 5 6 7 8 9 10 11 A = 2 5 2 4 1 7 5 8 3 8 6 l r min ? return 1 * Applications Lowest Common Ancestors (LCA) A B C I D E K J G H F A = I D B E A J F K C G C H 0 1 2 3 H = 3 2 1 2 0 3 2 3 1 2 1 2 J G H = 3 2 1 2 0 3 2 3 1 2 1 2 A = I D B E A J F K C G C H C * Applications Longest common extensions of strings (LCE) t= i j abba abba x z RMQs on the LCP-table of suffix array Other applications Document Retrieval (Muthukrishnan SODA’02) Suffix links in ESA (Abouldhoda et al. WABI’02) Maximum-Sum Queries (Chen/Chao ISAAC‘04) … ? basic ingredient! * Previous Results for RMQ Berkman/Vishkin FOCS‘89: Preprocessing O(n) Query time O(1) Redisco