摘要： /*最长回文子串*/#include<iostream>#include<string.h>#include<ctype.h>using namespace std;#define Max 5000 +10char buf[Max],s[Max];int p[Max];int main(){ int n,m=0,max=0; int i,j; //int k; int x,y; fgets(buf,sizeof(s),stdin); n=strlen(buf); for(i=0;i<n;i++) if(isalpha(buf[i])) ... 阅读全文