1040. Longest Symmetric String (25)

最新推荐文章于 2024-08-09 22:07:01 发布

陈小旭

最新推荐文章于 2024-08-09 22:07:01 发布

阅读量967

点赞数

分类专栏： PAT 文章标签： PAT 最长回文子串

本文链接：https://blog.csdn.net/apie_czx/article/details/46627867

版权

PAT 专栏收录该内容

104 篇文章 0 订阅

订阅专栏

题目链接：http://www.patest.cn/contests/pat-a-practise/1040

题目：

1040. Longest Symmetric String (25)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Given a string, you are supposed to output the length of the longest symmetric sub-string. For example, given "Is PAT&TAP symmetric?", the longest symmetric sub-string is "s PAT&TAP s", hence you must output 11.

Input Specification:

Each input file contains one test case which gives a non-empty string of length no more than 1000.

Output Specification:

For each test case, simply print the maximum length in a line.

Sample Input:

Is PAT&TAP symmetric?

Sample Output:

分析：

找到一个字符串的最长回文子串，那个时候还不知道kmp,manacher，用比较搓的方法做出来的。

AC代码：

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
int main(){
 //freopen("F://Temp/input.txt", "r", stdin);
 string str;
 string str_r;
 getline(cin,str);
 str_r = str;
 reverse(str_r.begin(),str_r.end());  //included in the <algorithm>
//先把字符串逆序，然后比较正序和逆序中相同的部分，即为最长回文子串
 int same = 0, sum = 0;
 for (int i = 0; i < str.size(); i++){
  sum = 0;
  for (int j = 0, rj = i; j < str.size() - i; j++,rj ++){
   if (str_r[rj] == str[j]){
    sum++;
    if (sum > same)same = sum;
   }
   else sum = 0;
  }
  sum = 0;
  for (int j = 0, rj = i; j < str.size() - i; j++, rj++){
   if (str_r[j] == str[rj]){
    sum++;
    if (sum > same)same = sum;
   }
   else sum = 0;
  }
 }
 cout << same << endl;
 return 0;
}

截图：