I need help to solve SPOJ — BUILDING
I can solve it in O( total h_i * 2 * log(m) ). But it is not enough to get Accepted.
How can i optimize complexity?
# | 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 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
I need help to solve SPOJ — BUILDING
I can solve it in O( total h_i * 2 * log(m) ). But it is not enough to get Accepted.
How can i optimize complexity?
Need some help to solve Very Dirty String problem.
Short Description:
Given three strings A, B and C. Find the longest common sub-sequence of A and B, which have C at-least once as a substring in it.
Input: There will be T test cases. For each test there will be three lines describing string A, B, and C.
Constraints: 1 ≤ T ≤ 100 1 ≤ |A|, |B|, |C| ≤ 100
My approach: I tried it using normal recursive LCS with extra another state pointing the index of string C i'm trying to match.
here is my code.
Sorry for my bad English.
Name |
---|