HDOJ 4763 Theme Section
来源:互联网 发布:java 异常处理机制5种 编辑:程序博客网 时间:2024/05/19 20:46
扩展kmp找前缀长。。。
Theme Section
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 968 Accepted Submission(s): 512
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
Source
2013 ACM/ICPC Asia Regional Changchun Online
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=1100000;char P[maxn];int next[maxn];void pre_exkmp(char P[]){ int m=strlen(P); next[0]=m; int j=0,k=1; while(j+1<m&&P[j]==P[j+1]) j++; next[1]=j; for(int i=2;i<m;i++) { int p=next[k]+k-1; int L=next[i-k]; if(i+L<p+1) next[i]=L; else { j=max(0,p-i+1); while(i+j<m&&P[i+j]==P[j]) j++; next[i]=j; k=i; } }}int main(){ int T_T; scanf("%d",&T_T);while(T_T--){ scanf("%s",P); int n=strlen(P); pre_exkmp(P); int ans=0; for(int i=1;i+ans<n;i++) { int Len=min(next[i],i); while(n-Len<i+Len&&Len>ans) Len--; if(Len<=ans) continue; for(int j=n-Len;j<n-ans;j++) { if(next[j]>=n-j) { ans=max(ans,n-j);break; } } } printf("%d\n",ans);} return 0;}
0 0
- HDOJ 4763 Theme Section
- 【HDOJ 4763】 Theme Section (KMP+strstr)
- 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
- HDOJ 4763 - Theme Section 利用KMP的fail数组,,很暴力
- KMP-hdu-4763-Theme Section
- hdu 4763 Theme Section (双哈希)
- hdu 4763 Theme Section(KMP)
- java System.currentTimeMillis()陷阱
- 第四周作业
- android源码查看 android-support-v4.jar
- 关于javascript中alert单线程问题以及网页乱码问题之一
- C++全局变量构造函数的调用
- HDOJ 4763 Theme Section
- poj 3258 BinarySearch 最大化最小值
- 计科《算法设计与分析》第三周作业——冒泡排序和归并排序
- 同步Vmware中系统与主机的时间
- Eclipse反编译插件的安装
- 库函数qsort的实现
- jaxp dom 的 update/delete /save
- NET Framework 3.5 sp1离线安装方案
- 记12306货运系统“抢订空车”插件的编写--订车流程梳理