UvaLive6439（string使用、回文串）

样例手写一写很容易发现规律（前后一样的串，则ans+=2），实现起来却忘了string的便捷性，其实根本用不到哈希。

 

const int maxn = 1e5 + 5;
int n, ans;
string s, t1, t2;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n;
    for (int kase = 1; kase <= n; kase++) {
        cin >> s;
        ans = 0;
        t1 = t2 = "";
        int i = 0, j = s.length() - 1;
        while (i < j) {
            t1 = t1 + s[i];
            t2 = s[j] + t2;
            if (t1 == t2) {
                ans += 2;
                t1 = t2 = "";
            }
            ++i, --j;
        }
        if (t1 != t2 || (t1 == t2 && i == j))    ans++;
        cout << "Case #" << kase << ": " << ans << endl;
    }
    return 0;
}