1040?Longest Symmetric String?（25?分)

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:

11

解析：基礎的字符串處理。

#include<bits/stdc++.h> using namespace std;#define ee exp(1) #define p acos(-1) #define mod 1000000007 #define inf 0x3f3f3f3f #define ll long long #define ull unsigned long long #define mem(a,b) memset(a,b,sizeof(a)) int gcd(int a,int b){return b?gcd(b,a%b):a;}string s; int symmetric(string str,int i,int j) {int x=i,y=j;for(;i<=(x+y)/2;i++){if(s[i]!=s[j--])return 0;}return true; } int main() {getline(cin,s);int maxlen=1;for(int i=0; i<s.size(); i++){for(int j=i; j<s.size(); j++){if(symmetric(s,i,j))maxlen=max(maxlen,j-i+1);}}printf("%d\n",maxlen);return 0; }

?

總結

以上是生活随笔為你收集整理的1040 Longest Symmetric String的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。