Girls' research
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 3494 Accepted Submission(s): 1331
Problem Description
One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps:
First step: girls will write a long string (only contains lower case) on the paper. For example, "abcde", but 'a' inside is not the real 'a', that means if we define the 'b' is the real 'a', then we can infer that 'c' is the real 'b', 'd' is the real 'c' ……, 'a' is the real 'z'. According to this, string "abcde" changes to "bcdef".
Second step: girls will find out the longest palindromic string in the given string, the length of palindromic string must be equal or more than 2.
First step: girls will write a long string (only contains lower case) on the paper. For example, "abcde", but 'a' inside is not the real 'a', that means if we define the 'b' is the real 'a', then we can infer that 'c' is the real 'b', 'd' is the real 'c' ……, 'a' is the real 'z'. According to this, string "abcde" changes to "bcdef".
Second step: girls will find out the longest palindromic string in the given string, the length of palindromic string must be equal or more than 2.
Input
Input contains multiple cases.
Each case contains two parts, a character and a string, they are separated by one space, the character representing the real 'a' is and the length of the string will not exceed 200000.All input must be lowercase.
If the length of string is len, it is marked from 0 to len-1.
Each case contains two parts, a character and a string, they are separated by one space, the character representing the real 'a' is and the length of the string will not exceed 200000.All input must be lowercase.
If the length of string is len, it is marked from 0 to len-1.
Output
Please execute the operation following the two steps.
If you find one, output the start position and end position of palindromic string in a line, next line output the real palindromic string, or output "No solution!".
If there are several answers available, please choose the string which first appears.
If you find one, output the start position and end position of palindromic string in a line, next line output the real palindromic string, or output "No solution!".
If there are several answers available, please choose the string which first appears.
Sample Input
b babd a abcd
Sample Output
0 2 aza No solution!
思路:马拉车跑一下,然后替换一下字母.注意各种位置计算,可能这也是问题的难点.
代码:
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
#define mod 1000000007
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
const double esp = 1e-7;
const int ff = 0x3f3f3f3f;
char s[maxn],str[maxn];
int l[maxn];
void pretreatment(char *str,int len)
{
int cnt = 0;
s[cnt] = '$';
for(int i = 0;i< len;i++)
{
s[++cnt] = '#';
s[++cnt] = str[i];
}
s[++cnt] = '#';
return ;
}
void solve(char *s,int len)
{
int mx = 0,id;
for(int i = 1;i< len;i++)
{
if(i< mx)
l[i] = min(l[2*id-i],mx-i);
else
l[i] = 1;
while(s[i+l[i]] == s[i-l[i]])
l[i]++;
if(i+l[i]> mx)
mx = i+l[i],id = i;
}
}
int main()
{
int cnt = 0;
char p;
while(~scanf(" %c %s",&p,str))
{
mem(l,0);
mem(s,0);
int len = strlen(str);
pretreatment(str,len);
solve(s,2*len+2);
int maxl = 0,ans;
for(int i = 1;i< 2*len+2;i++)
{
int tmp = l[i]-1;
if(tmp> maxl)
{
ans = i;
maxl = tmp;
}
}
if(maxl<= 1)
cout<<"No solution!"<<endl;
else
{
int ansl,ansr;
if(maxl&1)//计算在原串的左位置
ansl = ans/2-maxl/2-1;
else
ansl = ans/2-maxl/2;
ansr = ans/2+maxl/2-1;//计算在原串的右位置
printf("%d %d\n",ansl,ansr);
int tmp = p-'a';
for(int i = ansl;i<= ansr;i++)//不断计算替换后的字母
{
int tt = (str[i]-tmp+26);
if(tt> 122)
tt = 97+tt%123;
printf("%c",tt);
}
cout<<endl;
}
}
return 0;
}