Strongest String

We define a string to be made up of a collection of substrings. Each substring has a strength value, and the total strength of the string is the sum of the strength values of all the good substrings that occur inside the main string. We represent substrings and the main string as a collection of lowercase English alphabetic letters, and the same substring may appear multiple times in a string. __