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 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
8 | Dominater069 | 154 |
8 | nor | 154 |
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.