Palindromic Query

Правка en2, от YouKn0wWho, 2018-11-11 10:23:48

I am stuck on this following problem:

Statement:

Given a string of size n and q queries of type (l,r) you need to find how many palindromes are there in the substring of range [l...r].

Constraints:

1<=n,q<=100000

1<=l<=r<=n

Thanks for reading the problem. It will be really helpful if you can give me a solution.

Теги palindrome

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский YouKn0wWho 2018-11-11 10:23:48 3 Tiny change: '00\n\n1<=l,r<=n\n\nTh' -> '00\n\n1<=l<=r<=n\n\nTh'
en1 Английский YouKn0wWho 2018-11-11 10:19:16 356 Initial revision (published)