Time Limit: 6000/3000MS (Java/Others) Memory Limit: 128000/64000KB (Java/Others)
Now we have a long long string, and we will have two kinds of operation on it.
C i y : change the ith letter to y.
Q i j : check whether the substring from ith letter to jth letter is a palindrome.
There are multiple test cases.
The first line contains a string whose length is not large than 1,000,000.
The next line contains a integer N indicating the number of operations.
The next N lines each lines contains a operation.
All letters in the input are lower-case.
For each query operation, output "yes" if the corresponding substring is a palindrome, otherwise output "no".
Q 1 5
C 2 b
Q 1 5
Q 1 3
Adapted from a problem by yy17yy, 3x......