IX Zhautykov Olympiad : [Problem G] Round Words

Правка en2, от kalimm, 2015-11-04 16:46:57

What is the lenght of largest common subsequence of two round words? In a round word there is no difference from which symbol the word starts and in which direction it is read.

lcs("algorithm", "grammar") = "grma"

1≤N≤2000

http://izho.kz/uploads/izho_2013_en_inform.pdf

Do you have any solutions? Thanks for help.

Теги zhautykov, dp, whoreadstaganyway

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en5 Английский kalimm 2015-11-08 22:51:57 3 Tiny change: ' N ≤ 2000$\n\nhttp:/' -> ' N ≤ 2000$ \n\nhttp:/'
en4 Английский kalimm 2015-11-05 01:26:32 3 Tiny change: ' = "grma"$\n\n$1 ≤ N' -> ' = "grma"$ \n\n$1 ≤ N'
en3 Английский kalimm 2015-11-04 16:47:13 3 Tiny change: ' is read. \n\n$lcs(' -> ' is read. \n\n$lcs('
en2 Английский kalimm 2015-11-04 16:46:57 3 Tiny change: ' for help.' -> ' for help. '
en1 Английский kalimm 2015-11-03 10:31:29 383 Initial revision (published)