| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 2 | atcoder_official | 162 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | nor | 150 |
The LCS Range Queries Question. Need Help!
I am trying to solve a problem where I am given 2 strings A and B. Length of A is n and length of B is m. Now, q queries need to be answered. Each query will consist of 2 integers i and j such that 0 <= i,j <= n - 1. For each such query, I want to find the length of the longest common sub-sequence of A.sub_string(i, j) and B.
Constraints:
1 <= n <= 10^4
1 <= m <= 10^4
1 <= Q <= 10^3
Time Limit: 3 seconds
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
viralm | 2018-05-11 15:20:25 | 2 | Tiny change: '= Q <= 10^3\n\nTime L' -> '= Q <= 10^2\n\nTime L' | |
| en3 |
|
viralm | 2018-05-11 15:19:41 | 6 | Tiny change: 'such that 0 <= i,j <= n - 1. For each' -> 'such that 1 <= i,j <= n. For each' | |
| en2 |
|
viralm | 2018-05-11 15:16:15 | 5 | Tiny change: ' find the length of' -> ' find the length of' | |
| en1 |
|
viralm | 2018-05-11 15:14:15 | 506 | Initial revision (published) |
