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
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 4 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ 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: Apr/21/2026 06:04:26 (f1).
Desktop version, switch to mobile version.
Supported by
