hdu 4763Theme Section
来源:互联网 发布:黑帽seo好学吗 编辑:程序博客网 时间:2024/05/16 03:53
Theme Section
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4235 Accepted Submission(s): 2033
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<cstdio>#include<algorithm>#include<cstring>using namespace std;const int N = 1000000 + 10;char s[N];int next_[N];void makeNext(char s[]){int k = 0;next_[0] = 0;int len = strlen(s);for(int i = 1; i < len; i++){while(k > 0 && s[i] != s[k]){k = next_[k - 1];}if(s[i] == s[k]) k++;next_[i] = k;}}int main(){int t;scanf("%d", &t);while(t--){//getchar();scanf("%s", s);makeNext(s);int len = strlen(s);int i = next_[len - 1];int ans=0;while(i > 0){int k = len - i - 1;while(next_[k] == 0 && k >= 2 * i - 1){k--;}if(next_[k] >= i){ans = i;break;}//i = next_[i - 1];//i = next_[k - 1];i--;}printf("%d\n", ans);}return 0;}
阅读全文
0 0
- HDU 4763 Theme Section
- hdu 4763 Theme Section
- hdu 4763 Theme Section
- HDU-4763 Theme Section
- HDU 4763 Theme Section
- Hdu-4763 Theme Section
- hdu 4763 Theme Section
- hdu 4763 Theme Section
- HDU 4763Theme Section
- hdu 4763 Theme Section
- hdu 4763 Theme Section
- hdu 4763Theme Section
- KMP-hdu-4763-Theme Section
- hdu 4763 Theme Section (双哈希)
- hdu 4763 Theme Section(KMP)
- hdu 4763 Theme Section kmp
- HDU 4763 Theme Section(KMP)
- hdu 4763 Theme Section(KMP)
- Request对象的概述及API的介绍 Request对象的概述:什么是Request对象;Request对象的API的代码演示
- 深入理解 Java中 的 final 关键字
- 寻找和为定值的k个数
- 配置阿里云服务器教程(安全组,连接服务器,jdk+tomcat+mysql)
- iOS 蓝牙4.0开发
- hdu 4763Theme Section
- safe area layout guide before ios 9.0
- Android:获取应用信息,打开、卸载应用
- eval()函数的作用
- C#泛型(一)——泛型概述
- Adobe Acrobat 9.0 Pro 简体中文专业版 免激活
- 双链表的创建与输出
- JSP的概述;JSP的运行原理 JSP的简单使用
- 剑指offer-从头到尾打印链表