TIMUS 1960

Revision en1, by saba_tavdgiridze, 2016-10-05 12:35:00

Hi , I was trying to solve this problem , which is about finding number of unique palindromic substrings in string of size n . As n can be large(10^5) ,only feasible is nlogn algorithm for this problem.Can you help me ? ( I was trying to solve with suffix array but don't succeed )

Tags #strings, suffix array


  Rev. Lang. By When Δ Comment
en1 English saba_tavdgiridze 2016-10-05 12:35:00 349 Initial revision (published)