The tag says "DP"
I have tried many DP forms
DP[i][j] = true if S[i, j] is a wraparound string`` TLE
DP[i] = # of substrign ending at index i``` --> Can't find recurrence because of distinct condition.
Any help?
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
The tag says "DP"
I have tried many DP forms
DP[i][j] = true if S[i, j] is a wraparound string`` TLE
DP[i] = # of substrign ending at index i``` --> Can't find recurrence because of distinct condition.
Any help?
Name |
---|
Seems pretty straightforward. For every character c , store the maximum length of a "good" substring ending at c. Answer would be the sum over all the characters , O(N) time and O(1) space.
Something like this should work.
Ah dammit, you finding this "straightforward," is pretty dis-heartening. I'm kind of disappointed I couldn't come up with this.
How do you come up with solutions like this? Ie, how did you think of this?
I dont know how to answer this. This just comes from practice i guess.