Given a suffix array we have to calculate the lexicographical smallest string which has the same suffix array . Can someone please give some hint how to solve this problem ?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
8 | ecnerwala | 3494 |
9 | Um_nik | 3396 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | -is-this-fft- | 161 |
3 | maomao90 | 159 |
3 | atcoder_official | 159 |
5 | cry | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 153 |
10 | Dominater069 | 152 |
Given a suffix array we have to calculate the lexicographical smallest string which has the same suffix array . Can someone please give some hint how to solve this problem ?
Name |
---|
Assume that x y — two consecutive suffices in suffix array. First of all, we know that s[x] <= s[y]. Moreover, (s[x] < s[y]) or ((s[x] = s[y]) and (s[x+1:] < s[y+1:])). Do we have a way to compare two suffices?
I think it is big enough hint to solve the problem, but if you still don't understand how after 20-30 minutes thinking, I can explain solution in PM.
I think I got an idea . Thanks for your help :)