URAL 1989 Subpalindromes

原题戳

---

Time limit: 0.5 second
Memory limit: 64 MB

---

Description

You have a string and queries of two types:
replace i’th character of the string by character a;
check if substring sj…sk is a palindrome.

---

Input

The first line contains a string consisting of n small English letters. The second line contains an integer m that is the number of queries (5 ≤ n, m ≤ 105). The next m lines contain the queries.
Each query has either form “change i a”, or “palindrome? j k”, where i, j, k are integers (1 ≤ i ≤ n; 1 ≤ j ≤ k ≤ n), and character a is a small English letter.

---

Output

To all second type queries, you should output “Yes” on a single line if substring sj…sk is a palindrome and “No” otherwise.

---

Sample

input

abcda
5
palindrome? 1 5
palindrome? 1 1
change 4 b
palindrome? 1 5
palindrome? 2 4

output

No
Yes
Yes
Yes

---

题意：
给定一个字符串(长度<=100000)，有两个操作。 1：改变某个字符。 2：判断某个子串是否构成回文串。

---

思路：
神奇的线段树和神奇的哈希登场~
各位大犇们可以先想想线段树维护字符串哈希如何实现（但是想出来了也不会有糖吃

思路戳（当然你要想完了再戳！

---

蛤蛤 是不是感觉妈妈再也不用担心我的线段树思路啦~
不客气！