| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
IX Zhautykov Olympiad : [Problem G] Round Words
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.
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
