uva 10617

DP永遠是我的弱點

1.  str[i]==str[j]   dp[i][j]+=dp[i+1[j-1]+1    刪除中間的部分

2.  刪除str[i]  dp[i][j]+=dp[i+1][j]

3.  刪除str[j]  dp[i][j]+=dp[i][j-1]

4.  刪除str[i]跟str[j] dp[i+1][j-1] 因為第2跟第3加過重複了

//============================================================================
// Name        : Again Palindromes.cpp
// Date : 2013/4/21 下午12:00:14
// Author : GCA
//============================================================================
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <cctype>
#include <utility>
using namespace std;
#ifdef ONLINE_JUDGE
#define ll "%lld"
#else
#define ll "%I64d"
#endif
typedef unsigned int uint;
typedef long long int Int;
#define Set(a,s) memset(a,s,sizeof(a))
#define Write(w) freopen(w,"w",stdout)
#define Read(r) freopen(r,"r",stdin)
#define Pln() printf("\n")
#define I_de(x,n)for(int i=0;i<n;i++)printf("%d ",x[i]);Pln()
#define De(x)printf(#x"%d\n",x)
#define For(i,x)for(int i=0;i<x;i++)
#define CON(x,y) x##y
#define Pmz(dp,nx,ny)for(int hty=0;hty<ny;hty++){for(int htx=0;htx<nx;htx++){\
    printf("%d ",dp[htx][hty]);}Pln();}
#define M 55
#define PII pair<int,int>
#define PB push_back
#define oo INT_MAX
#define Set_oo 0x3f
#define Is_debug true
#define debug(...) if(Is_debug)printf("DEBUG: "),printf(__VA_ARGS__)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define eps 1e-6
bool xdy(double x,double y){return x>y+eps;}
bool xddy(double x,double y){return x>y-eps;}
bool xcy(double x,double y){return x<y-eps;}
bool xcdy(double x,double y){return x<y+eps;}
int min3(int x,int y,int z){
    int tmp=min(x,y);
    return min(tmp,z);
}
int max3(int x,int y,int z){
    int tmp=max(x,y);
    return max(tmp,z);
}
Int dp[100][100];
char str[100];
int main() {
    ios_base::sync_with_stdio(0);
    int test;
    scanf("%d",&test);
    while(test--){
        Set(dp,0);
        scanf("%s",str);
        int n=strlen(str);
        for(int i=0;i<n;i++)dp[i][i]=1;
        for(int k=1;k<n;k++){
            for(int i=0;i+k<n;i++){
                if(str[i]==str[i+k]){
                    dp[i][i+k]+=dp[i+1][i+k-1]+1;
                }
                dp[i][i+k]+=dp[i+1][i+k];
                dp[i][i+k]+=dp[i][i+k-1];
                dp[i][i+k]-=dp[i+1][i+k-1];
            }
        }
        printf("%lld\n",dp[0][n-1]);
    }


}