Can someone please explain how to solve this problem.
https://csacademy.com/contest/round-79/task/smallest-subsets/statement/
Thanks in Advance!
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Can someone please explain how to solve this problem.
https://csacademy.com/contest/round-79/task/smallest-subsets/statement/
Thanks in Advance!
Can someone please help with this problem.
Given a string (s) and some queries where each query is of the form [l, r] we need to find the number of palindromic substrings, where the length of each substring lies in between [l, r].
Constraints
1 <= |S| <= 100000
1 <= |q| <= 100000
1 <= l < r <= |S|
Sample Case:
s = "zz"
q = 1
[l, r] = [1, 2]
For this, the answer must be 3. 'z', 'z', 'zz' are the three substrings which are palindrome and their length in between [1, 2].
The substrings to be considered may not be distinct, i.e if s = "zzz" then "zz" is to be considered twice.
Thanks in Advance!
Name |
---|