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?
→ Pay attention
→ Top rated
| # | 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 |
→ Top contributors
| # | 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 |
→ Find user
→ Recent actions
How to find max substring for two strings max len of wich can be 1e5
Revision en1, by Voronov-Dima_444, 2024-09-10 10:18:36
History
Revisions
| 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 | Первая редакция (сохранено в черновиках) |
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/10/2026 02:51:00 (g2).
Desktop version, switch to mobile version.
Supported by
