回文词 Palindrome

直接动态规划

#include<stdio.h>

#define Max 5001

short L[Max][Max];

int main(){

int n,i,j;

char s[Max];

scanf("%d",&n);

scanf("%s",s+1);

for(j=1;j<=n;j++)

for(i=n;i>=1;i--){

if(i>=j)L[i][j] = 0;

else{

if(s[i] == s[j]) L[i][j] = L[i+1][j-1];

else L[i][j] = (L[i+1][j]>L[i][j-1]?L[i][j-1]:L[i+1][j]) + 1;

}

}

printf("%d",L[1][n]);

}

 第二种，求最大公共子序列满足回文

#include<stdio.h>

#define Max 5001

short L[Max][Max];

int main(){

int n,i,j;

char s[Max];

char si[Max];

scanf("%d",&n);

scanf("%s",s+1);

for(i=1,j=n;i<=n;i++,j--)si[j] = s[i];

for(i=0;i<Max;i++) L[0][i] = L[i][0] = 0;

for(i=1;i<=n;i++)

for(j=1;j<=n;j++){

if(s[i] == si[j])

L[i][j] = L[i-1][j-1] + 1;

else{

L[i][j] = L[i][j-1] > L[i-1][j] ? L[i][j-1] : L[i-1][j];

}

}

printf("%d",n-L[n][n]);

}