hdu4763 Theme Section (KMP)
来源:互联网 发布:散热器优化仿真 编辑:程序博客网 时间:2024/05/22 02:24
http://acm.hdu.edu.cn/showproblem.php?pid=4763
Theme Section
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
#include<iostream>#include<stdio.h>#include<string.h>using namespace std;int next[1000009];char s[1000009];int len;void getnext(){ int i=0,j=-1; next[0]=-1; while(i<len) { if(j==-1||s[i]==s[j])next[++i]=++j; else j=next[j]; }}int main(){ int n,i,k; scanf("%d",&n); while(n--) { scanf("%s",s); len=strlen(s); getnext(); i=len; while (i) { if(next[i]*3<=len)break; else i=next[i]; } if(i==0||len<3) { printf("0\n"); continue ; } i=next[i]; int ans=-1; for(k=1;k<len;k++) { if(k>=next[k]*2&&k<=len-next[k]&&next[k]>ans)ans=next[k]; if(ans==i)break; } printf("%d\n",ans); } return 0;}
- hdu4763 Theme Section KMP
- hdu4763 Theme Section (KMP)
- HDU4763 Theme Section 【KMP】
- HDU4763 Theme Section KMP
- HDU4763 - Theme Section(KMP)
- hdu4763 Theme Section(kmp)
- Theme Section(KMP应用 HDU4763)
- HDU4763 Theme Section(KMP+扩展KMP)
- HDU4763-Theme Section(KMP+二分)
- hdu4763 Theme Section(KMP水题)
- HDU4763 Theme Section KMP-next应用
- hdu4763---Theme Section
- HDU4763 Theme Section
- HDU4763 Theme Section(next数组__kmp+扩展)
- hdu_4763 Theme Section KMP
- KMP Theme Section HDU
- KMP-hdu-4763-Theme Section
- hdu 4763 Theme Section(KMP)
- Oracle网络相关等待事件(转)
- Hadoop DataNode启动之asyncDiskService
- 几个问题的总结
- 对给定的3个整数从小到大排序
- 如何理解递归
- hdu4763 Theme Section (KMP)
- PB事件与SENDMESSAGE函数的关系
- 管家婆服装.NET II TOP V6.5-VIP卡使用注意事项(一)
- C# windows 服务(转)
- Cocos2dx Cygwin编译-格式问题“CocosDenshion/android/SimpleAudioEngine” make error解决方法
- FFT 变化
- GCC 参数详解
- 异或运算交换两个元素位置,不需要额外空间
- 编程之美一 : 让CPU占有率曲线听你指挥