i'm trying to solve this problem but i can't find any algorithm better than O(n^2) !
your help will be greatly appreciated.
№ | Пользователь | Рейтинг |
---|---|---|
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 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Название |
---|
Auto comment: topic has been updated by Mid0 (previous revision, new revision, compare).
Consider some substring S[i...j]. Let parity[K] for 0<=K<=9 be the parity of the number of occurrences of digit K in subtring S[i...j]. Notice that the substring will be a palindrome if and only if parity[K] is 0 for all K or there is only one K for which parity[K] is 1 and parity[K] is 0 for all other Ks.
Having that in mind, we will loop from 1 to N and at each step we will find the number of those palindromes ending at the current position i. In order to do that, let parity[K] be the described parity for digit K in substring S[1...i]. Consider some j (1<=j<=i). Substring S[j...i] can be made a palindrome if all parities for position j-1 are the same as the parities for position i or there is only one difference.
For each position, we can store the parities as a bitmask with 10 bits and that way we can find the answer quickly. Check my code for more details: http://ideone.com/1grO2A :)
got it , nice usage of bitwise , thank you :)