We're given two strings, and , containing only uppercase English characters (
If a character at index of string is the same as the character at index of string , the two strings may cross at those indices. We define this as a string crossing.
Here is a visual example of a string crossing:
G O HELLOWORLD D B Y E
You are allowed to modify up to one character in string by changing the character at any index to another uppercase English character.
Your job is to determine the maximum number of string crossings after modifying up to one character in string .
For this problem, you will NOT be required to pass all the samples to receive points, and you are NOT required to pass all previous subtasks to receive points for a specific subtask.
represents the length of a string .
Subtask 1 [6/15]
Subtask 2 [4/15]
and will only contain the characters
Subtask 3 [5/15]
No additional constraints.
The first line will contain and , space-separated.
The second line will contain .
The third and final line will contain .
Output one integer on one line, the maximum number of string crossings after modifying up to one character in string .
10 7 HELLOWORLD GOODBYE
Without any modifications, we can count string crossings.
If we change the
GOODBYE to an
L, we can now count crossings.