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 | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
9 | TheScrasse | 144 |
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 |
---|