2697

You are given a string s consisting of lowercase English letters, and you are allowed to perform operations on it. In one operation, you can replace a ......

## 题目 [link](https://www.luogu.com.cn/problem/P2697) ## 思路 将字符串中 $G$ 换为 $-1$, $R$ 换为 $1$, 进行前缀和处理, 若和为 $0$, 则为稳定的宝石串，比较记录最大值 ## Code ```cpp #include u ......