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?
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
2 | maomao90 | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 149 |
7 | SecondThread | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
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?
Название |
---|
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.