lightoj - 1033 - Generating Palindromes - dp/ 最长公共子序列lcs

题意：给一个串，可以在任意位置增加字符，求增加最少的字符使得原串成为回文串。

题解：可以将原串倒置，求两串LCS，需要注意当j != n - i的特殊情况。

#include <bits/stdc++.h>
//#pragma comment(linker, "/STACK:1024000000,1024000000")

using namespace std;

#define ll long long
#define SZ(x) ((int)(x).size()) 
#define ALL(v) (v).begin(), (v).end()
#define foreach(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++ i)
#define reveach(i, v) for (__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++ i) 
#define REP(i,a,n) for ( int i=a; i<int(n); i++ )
#define FOR(i,a,n) for ( int i=n-1; i>= int(a);i-- )
#define lson rt<<1, L, m
#define rson rt<<1|1, m, R
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define fi first
#define se second
#define CLR(a, b) memset(a, b, sizeof(a))
#define Min(a, b) a = min(a, b)
#define Max(a, b) a = max(a, b)
const int maxn = 1e2 + 7;
int T;
int kase;
int n;
char s[maxn];
char t[maxn];
int dp[maxn][maxn];
int solve(){
    CLR(dp, 0);
    int res = 0;
    int ans = 1e9 + 7;
    dp[0][0] = s[0] == t[0] ? 1 : 0;
    REP(i, 1, n + 1){
        REP(j, 1, n - i + 1){
            if(s[i] == t[j]) Max(dp[i][j], dp[i-1][j-1] + 1);
            Max(dp[i][j], dp[i-1][j]);
            Max(dp[i][j], dp[i][j-1]);
            Max(res, dp[i][j]);
            if(j != n - i){
                Min(ans, n - 2 - dp[i][j] * 2);
            }
        }
    }
    //puts("");
    //cout << res << endl;
    if(!res) return n - 2;
    return min(n - 1 - res * 2, ans);
}
int main(){
#ifdef ac
    freopen("in.txt","r",stdin);
#endif
    //freopen("out.txt","w",stdout);
    scanf("%d", &T);
    while(T--){
        scanf("%s", s + 1);
        s[0] = 1;
        n = strlen(s);
        REP(i, 1, n + 1) t[n-i+1] = s[i];
        printf("Case %d: %d\n", ++ kase, solve());
    }
    return 0;
}