Can someone please explain how to solve this problem.
https://csacademy.com/contest/round-79/task/smallest-subsets/statement/
Thanks in Advance!
№ | Пользователь | Рейтинг |
---|---|---|
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 | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
7 | Petr | 147 |
7 | atcoder_official | 147 |
9 | TheScrasse | 145 |
9 | nor | 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!
Название |
---|