Modified Version of String Transformation (Round 659)

Revision en1, by johnkim3104, 2020-07-28 11:39:29

I’m wondering if it’s possible to solve the problem https://codeforces.net/problemset/problem/1383/A?locale=en with the additional constraint that, instead of being able to select sunsets of the same letter, that you can only select adjacent consecutive substrings all of the same letter. What time constraints could this be solved in?

Tags #problem discussion, #string

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English johnkim3104 2020-07-28 11:40:59 53
en2 English johnkim3104 2020-07-28 11:39:59 2 Tiny change: ' select sunsets of th' -> ' select subsets of th'
en1 English johnkim3104 2020-07-28 11:39:29 388 Initial revision (published)