PAT (Advanced Level) Practice 1040 Longest Symmetric String (25分)

字符串模拟

#include<bits/stdc++.h>
#define ll long long 
const int mod=1e9+7;
using namespace std;
int main()
{
	string s;
	getline(cin,s);
	int maxx=-1;
	for(int i=0;i<s.length();i++) //..cabac..型 
	{
		int u=i-1;
		int v=i+1;
		int sum=1;
		while(u>=0&&v<s.length()&&s[u]==s[v])
		{
			sum+=2;
			u--;
			v++;
		}
		if(sum>maxx)
			maxx=sum;
	}
	for(int i=0;i<s.length();i++) //..cabbac..型 
	{
		if(s[i]==s[i+1])
		{
			int u=i-1;
			int v=i+2;
			int sum=2;
			while(u>=0&&v<s.length()&&s[u]==s[v])
			{
				sum+=2;
				u--;
				v++;
			}
			if(sum>maxx)
				maxx=sum;
		}
		
	}
	cout<<maxx<<endl;
	return 0;
}