#include <iostream> using namespace std; int findhui(string& s, int i){ int res = 1; int j = i - 1; int k = i + 1; while(j >= 0 && k < s.size()){ if(s[j] == s[k]) res += 2; else break; j--; k++; } return res; } int findhui2(string& s, int i1, int i2){ int res = 0; while(i1 >= 0 && i2 ...