Hi, Codeforces! Can you explain me, how to find max length of substr for 2 strings max length of which can be 1e5. How to do this without polynomial hash?
How to find max substring for two strings max len of wich can be 1e5
Hi, Codeforces! Can you explain me, how to find max length of substr for 2 strings max length of which can be 1e5. How to do this without polynomial hash?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en1 |
|
Voronov-Dima_444 | 2024-09-10 10:18:36 | 223 | Initial revision for English translation | |
| ru1 |
|
Voronov-Dima_444 | 2024-09-10 10:10:34 | 193 | Первая редакция (сохранено в черновиках) |
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
