Theme Section(KMP应用 HDU4763)
2015-09-05 15:15
344 查看
Theme Section
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1995 Accepted Submission(s): 943
Problem Description
It’s time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challenging, the hosts are going to add some constraints to the rhythm of the songs, i.e., each song is required to have a ‘theme section’. The theme section shall be played at the beginning, the middle, and the end of each song. More specifically, given a theme section E, the song will be in the format of ‘EAEBE’, where section A and section B could have arbitrary number of notes. Note that there are 26 types of notes, denoted by lower case letters ‘a’ - ‘z’.
To get well prepared for the festival, the hosts want to know the maximum possible length of the theme section of each song. Can you help us?
Input
The integer N in the first line denotes the total number of songs in the festival. Each of the following N lines consists of one string, indicating the notes of the i-th (1 <= i <= N) song. The length of the string will not exceed 10^6.
Output
There will be N lines in the output, where the i-th line denotes the maximum possible length of the theme section of the i-th song.
Sample Input
5
xy
abc
aaa
aaaaba
aaxoaaaaa
Sample Output
0
0
1
1
2
Source
2013 ACM/ICPC Asia Regional Changchun Online
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1995 Accepted Submission(s): 943
Problem Description
It’s time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challenging, the hosts are going to add some constraints to the rhythm of the songs, i.e., each song is required to have a ‘theme section’. The theme section shall be played at the beginning, the middle, and the end of each song. More specifically, given a theme section E, the song will be in the format of ‘EAEBE’, where section A and section B could have arbitrary number of notes. Note that there are 26 types of notes, denoted by lower case letters ‘a’ - ‘z’.
To get well prepared for the festival, the hosts want to know the maximum possible length of the theme section of each song. Can you help us?
Input
The integer N in the first line denotes the total number of songs in the festival. Each of the following N lines consists of one string, indicating the notes of the i-th (1 <= i <= N) song. The length of the string will not exceed 10^6.
Output
There will be N lines in the output, where the i-th line denotes the maximum possible length of the theme section of the i-th song.
Sample Input
5
xy
abc
aaa
aaaaba
aaxoaaaaa
Sample Output
0
0
1
1
2
Source
2013 ACM/ICPC Asia Regional Changchun Online
#include <map> #include <set> #include <queue> #include <cstring> #include <string> #include <cstdio> #include <iostream> #include <algorithm> using namespace std; const int INF = 0x3f3f3f3f; const int MAX = 1e6+100; char str[MAX]; int Next[MAX]; void GetNext()//KMP得到Next数组 { int len=strlen(str); Next[0]=-1; int i=1,j=0; while(i<len) { if(j==-1||str[i]==str[j]) { i++; j++; Next[i]=j; } else { j=Next[j]; } } } int Judge(int len) { int Len=strlen(str); int i=len,j=0; while(i<Len-len) { if(j==-1||str[i]==str[j]) { i++; j++; } else { j=Next[j]; } if(j==len) { return len; } } return -1; } int main() { int T; scanf("%d",&T); while(T--) { scanf("%s",str); int len=strlen(str); if(len<3) { printf("0\n"); continue; } GetNext(); int R=strlen(str); int Max=-1; while(Next[R]>=0) { if(Next[R]>Max) { int ans=Judge(Next[R]); if(ans>Max) { Max=ans ; break; } } R=Next[R]; } if(Max==-1) { printf("%d\n",Max+1); } else printf("%d\n",Max); } return 0; }
相关文章推荐
- SecureCRT异常关闭,后台进程中断原因及解决办法---nohup
- poj 3662 Telephone Lines(好题!!!二分搜索+dijkstra)
- I.MX6 ar1020 SPI device driver hacking
- String StringBuffer StringBuilder 区别
- php 编码规范【自用】
- VO,PO,POJO的定义和区别
- HDU 5245 Joyful (数学概率求期望)
- HDU1042 - N! (大数运算)
- URL
- ROS(3):耶鲁开源机器人手臂
- Shell命令行操作
- iOS求职之C语言面试题
- hdu 5256 序列变换 求最少改变次数使序列变为递增 最长不下降子序列
- PS 滤镜— —扇形warp
- C++蜗牛
- 手机应用图标的展现扩展方式
- cocos2d-x经验分享
- iOS求职之OC面试题
- UTF-8 delphi 函数
- 【C++】类的特殊成员变量+初始化列表