On Monday, May 13, 2013 1:13:03 PM UTC+5:30, LivE wrote: > Most of the compression algorithms do something similar. Probably will help > you solve the problem. Good luck > > On May 13, 2013 12:25 PM, "Piyush Raman" <[email protected]> wrote: > > I have been trying to solve this problem- http://www.spoj.com/problems/ABA12B/ > > but am having difficulty in finding any efficient approach. Kindly help. > > Can we use suffix arrays to solve this problem? > > > > -- > > You received this message because you are subscribed to the Google Groups > "Google Code Jam" group. > > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > > To post to this group, send email to [email protected]. > > To view this discussion on the web visit > https://groups.google.com/d/msgid/google-code/32fbfd07-bf15-4456-8cdb-56ce603a9375%40googlegroups.com?hl=en. > > > For more options, visit https://groups.google.com/groups/opt_out.
im sorry but i did not understand... I know huffmann tree method for data compression but am not able to relate it with this question.... Can you please guide me further? -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/57ee5e14-e0a2-4a51-97af-b93be671c763%40googlegroups.com?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
