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 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
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 |
---|