| ENG RUS | Timus Online Judge |
Обсуждение задачи 1714. Мнемоника и палиндромы 2💮meanlessnessener`~ What about "aa...a" strings? // Задача 1714. Мнемоника и палиндромы 2 15 сен 2023 00:39 Why can't I construct strings like "aa...a"? There is only one palindrome (the whole string) and it's the minimum value of palindromes obviously. Where is the contradiction the the statement? Vedernikoff Sergey (HSE: АОП) Proof of the result? (+) [1] // Задача 1714. Мнемоника и палиндромы 2 20 сен 2010 02:43 Ok, I've found relation between n and maximin palindrome number and several optimal patterns that depend on n mod 12. Only one question has left: how to prove all this stuff? 👨🏻💻 Spatarel Dan Constantin Re: Proof of the result? (+) // Задача 1714. Мнемоника и палиндромы 2 5 сен 2019 04:11 My AC solution is using n mod 6 to determine the optimal solution. The proof is rather complicated and heavily relies on some particular pattern of length 6. Apart from that, it's just analysing lots and lots of cases. KOTMAKRUS Attention! Mistake in the statement, i think... // Задача 1714. Мнемоника и палиндромы 2 1 апр 2014 01:42 Sorry, i understand my mistake Edited by author 01.04.2014 01:43 Vani Solution [1] // Задача 1714. Мнемоника и палиндромы 2 13 мар 2012 21:11 xurshid_n Re: Solution // Задача 1714. Мнемоника и палиндромы 2 8 июн 2012 12:42 thank you, very helpful Slobodan No subject // Задача 1714. Мнемоника и палиндромы 2 2 май 2011 04:40 Edited by author 04.05.2011 02:28 XMAN What is test #13 please? // Задача 1714. Мнемоника и палиндромы 2 14 ноя 2009 00:50 Edited by author 14.11.2009 00:52 Aydar Bykeev How to construct strings? [2] // Задача 1714. Мнемоника и палиндромы 2 10 окт 2009 16:44 Subj Please, give me example for n = 1..5 Aydar Bykeev Re: How to construct strings? [1] // Задача 1714. Мнемоника и палиндромы 2 10 окт 2009 17:09 Please, help... XMAN Re: How to construct strings? // Задача 1714. Мнемоника и палиндромы 2 13 ноя 2009 22:05 n=1 ==> a (or b) n=2 ==> ab (or ba) n=3 ==> aab n=4 ==> aaba n=5 ==> aabab n=6 ==> aababb XMAN test #3 ===> n=2 // Задача 1714. Мнемоника и палиндромы 2 13 ноя 2009 21:54 the solution is "ab" or "ba" XMAN more test case please // Задача 1714. Мнемоника и палиндромы 2 13 ноя 2009 21:42 Aneto i do not understand the statement >( [4] // Задача 1714. Мнемоника и палиндромы 2 25 окт 2009 00:52 Why for n=6 aababbaa is OK abbaabaa is WA ? Who understands the statement or have AC please explain me statement on some examples or say what does it mean "The complexity of a name is defined as the minimal number of palindromes into which it can be decomposed. Help Vasechkin to invent the most complex name for his problem." Thank you in advance OpenGL Re: i do not understand the statement >( [2] // Задача 1714. Мнемоника и палиндромы 2 28 окт 2009 16:59 aa bab b aa - 4 palindromes abba aba a - 3 palindromes 4 is max number of palindromes in all string with length 8. Edited by author 28.10.2009 17:03 Aneto Re: i do not understand the statement >( [1] // Задача 1714. Мнемоника и палиндромы 2 29 окт 2009 00:36 what about a|a|b|a|b|b|a|a - 8 polyndromes :))) OpenGL писал(a) 28 октября 2009 16:59 aa bab b aa - 4 palindromes abba aba a - 3 palindromes 4 is max number of palindromes in all string with length 8. Edited by author 28.10.2009 17:03 OpenGL Re: i do not understand the statement >( // Задача 1714. Мнемоника и палиндромы 2 29 окт 2009 13:07 You wrote possible decomposition, but it not minimal. The complexity of a name is defined as the minimal number of palindromes into which it can be decomposed. Alias aka Alexander Prudaev Re: i do not understand the statement >( // Задача 1714. Мнемоника и палиндромы 2 29 окт 2009 14:55 Let's define F(S) as complexity of a string S. F(S) is equal to minimal number of palindromes into wicth it can be decomposed. for example consider string "abbaabaa" it can be decomposed in different ways a|bb|aabaa - 3 pflimdromes a|bb|a|aba|a - 5 pflindromes a|b|b|a|a|b|a|a - 8 palindromes the minimal number is 3, so F("abbaabaa") = 3 We must to find string S of given length N such that F(S) is maximal possible for all strings with legth N.
|