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 | 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 |
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 |
---|