hdu4763(kmp水题)
来源:互联网 发布:塔吉克斯坦 知乎 编辑:程序博客网 时间:2024/06/08 06:03
地址:http://acm.hdu.edu.cn/showproblem.php?pid=4763
Theme Section
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)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?
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
5xyabcaaaaaaabaaaxoaaaaa
Sample Output
00112
思路:暴力,用kmp稍微剩下时间。
代码:
#include<iostream>#include<cstring>#include<cstdio>using namespace std;char s[1000010];int next[1000010],len;void getnext(){ int i=0,j=-1; next[0]=-1; while(i<len) //以前在这里是调用strlen()函数来判断,TLE无数次 { if(j==-1||s[i]==s[j]) { i++;j++; next[i]=j; } else j=next[j]; }}int main(){ int t,k,ans; scanf("%d",&t); while(t--) { scanf("%s",s); len=strlen(s); getnext(); k=next[len];ans=0; while(k&&!ans) { int g=0; for(int i=k;i<len-k;i++) { if(g==k) break; while(!(g==-1||s[i]==s[g])) g=next[g]; g++; } if(g==k) ans=k; k=next[k]; } printf("%d\n",ans); } return 0;}
- hdu4763(kmp水题)
- hdu4763 Theme Section(KMP水题)
- hdu4763(kmp)
- hdu4763(KMP的应用)
- HDU4763 Theme Section(KMP+扩展KMP)
- HDU4763-Theme Section(KMP+二分)
- hdu4763 Theme Section KMP
- hdu4763 Theme Section (KMP)
- HDU4763 Theme Section 【KMP】
- HDU4763 Theme Section KMP
- hdu4763 扩展kmp
- hdu4763 扩展KMP
- HDU4763 - Theme Section(KMP)
- hdu4763 Theme Section(kmp)
- Theme Section(KMP应用 HDU4763)
- hdu4763
- hdu4763
- HDU4763 Theme Section KMP-next应用
- windows 多台套tomcat 环境变量的配置
- HDU 4189
- container_of
- 包办婚姻的Spring IoC
- 使用Zend Studio和火狐调试PHP代码
- hdu4763(kmp水题)
- 使用form里面的button跳转到其他页面
- 一个豌豆荚引发的血案——关于ADB server didn't ACK * failed to start daem
- Spring 注解 http://qzone.qq.com/blog/55357655-1232078233
- 寒江独钓-串口过滤
- Android作为客户端,PC作为服务端:实现网络通信
- 银行数据交换竖线分隔符注意事项
- hibernate中lazy的使用
- C#:协变和抗变