| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3845 |
| 2 | jiangly | 3707 |
| 3 | Benq | 3630 |
| 4 | orzdevinwang | 3573 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3532 |
| 8 | ecnerwala | 3501 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | adamant | 163 |
| 3 | awoo | 161 |
| 4 | nor | 152 |
| 4 | maroonrk | 152 |
| 6 | -is-this-fft- | 151 |
| 7 | TheScrasse | 149 |
| 8 | Petr | 145 |
| 8 | atcoder_official | 145 |
| 10 | pajenegod | 144 |
We can find out the total number of distinct substrings in the string by substracting the LCP (longest common prefix) of the suffix at each index with the suffix at the previous index.
Can someone help me in proving this?
Thanks in advance
Happy Coding
Here is an article explaining the logic behind the method: e-maxx-eng — Suffix Array. It's not too long, but I think it should be enough.