| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
Minimum Number of Substrings From a String Needed to Piece Together Another String
Given two non-empty strings A and B composed of lowercase Latin letters, what is the minimum number of substrings of A needed to form string B? The lengths of A and B are at most 100000. If the task is not possible for a given input, output a rogue value.
I was thinking about solving this with an O(N^2) DP, but that does not fit into the time limit of 5 seconds.
Please help, and thanks in advance!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
vamaddur | 2017-07-11 17:30:06 | 7 | Tiny change: ' O(N^2) DP, but that' -> ' O(N^2) DP method, but that' | |
| en4 |
|
vamaddur | 2017-07-11 11:20:55 | 6 | ||
| en3 |
|
vamaddur | 2017-07-11 11:19:40 | 6 | ||
| en2 |
|
vamaddur | 2017-07-11 11:18:52 | 371 | ||
| en1 |
|
vamaddur | 2017-07-11 10:36:28 | 500 | Initial revision (published) |
