POJ 题目 3693 Maximum repetition substring(后缀数组+RMQ+枚举求最小字典序的重复次数最多的子串)
来源:互联网 发布:php单选框提交 编辑:程序博客网 时间:2024/03/29 17:29
Description
The repetition number of a string is defined as the maximum number R such that the string can be partitioned intoR same consecutive substrings. For example, the repetition number of "ababab" is 3 and "ababa" is 1.
Given a string containing lowercase letters, you are to find a substring of it with maximum repetition number.
Input
The input consists of multiple test cases. Each test case contains exactly one line, which
gives a non-empty string consisting of lowercase letters. The length of the string will not be greater than 100,000.
The last test case is followed by a line containing a '#'.
Output
For each test case, print a line containing the test case number( beginning with 1) followed by the substring of maximum repetition number. If there are multiple substrings of maximum repetition number, print the lexicographically smallest one.
Sample Input
ccabababcdaabbccaa#
Sample Output
Case 1: abababCase 2: aa
思路先求重复次数最多的子串的重复次数,重复次数一样的存下他的循环节长度,然后枚举sa,先符合的一定是最小字典序的
ac代码
Problem: 3693User: kxh1995Memory: 10500KTime: 422MSLanguage: C++Result: Accepted
#include<stdio.h> #include<string.h> #include<algorithm> #include<iostream> #define min(a,b) (a>b?b:a) #define max(a,b) (a>b?a:b) using namespace std; char str[103030]; int sa[103030],Rank[103030],rank2[103030],height[103030],c[103030],*x,*y,s[103030],ans[100010]; int n; void cmp(int n,int sz) { int i; memset(c,0,sizeof(c)); for(i=0;i<n;i++) c[x[y[i]]]++; for(i=1;i<sz;i++) c[i]+=c[i-1]; for(i=n-1;i>=0;i--) sa[--c[x[y[i]]]]=y[i]; } void build_sa(char *s,int n,int sz) { x=Rank,y=rank2; int i,j; for(i=0;i<n;i++) x[i]=s[i],y[i]=i; cmp(n,sz); int len; for(len=1;len<n;len<<=1) { int yid=0; for(i=n-len;i<n;i++) { y[yid++]=i; } for(i=0;i<n;i++) if(sa[i]>=len) y[yid++]=sa[i]-len; cmp(n,sz); swap(x,y); x[sa[0]]=yid=0; for(i=1;i<n;i++) { if(y[sa[i-1]]==y[sa[i]]&&sa[i-1]+len<n&&sa[i]+len<n&&y[sa[i-1]+len]==y[sa[i]+len]) x[sa[i]]=yid; else x[sa[i]]=++yid; } sz=yid+1; if(sz>=n) break; } for(i=0;i<n;i++) Rank[i]=x[i]; } void getHeight(char *s,int n) { int k=0; for(int i=0;i<n;i++) { if(Rank[i]==0) continue; k=max(0,k-1); int j=sa[Rank[i]-1]; while(s[i+k]==s[j+k]) k++; height[Rank[i]]=k; } } int minv[103010][20],lg[103030]; void init_lg() { int i; lg[1]=0; for(i=2;i<102020;i++) { lg[i]=lg[i>>1]+1; } } void init_RMQ(int n) { int i,j,k; for(i=1;i<=n;i++) { minv[i][0]=height[i]; } for(j=1;j<=lg[n];j++) { for(k=0;k+(1<<j)-1<=n;k++) { minv[k][j]=min(minv[k][j-1],minv[k+(1<<(j-1))][j-1]); } } } int lcp(int l,int r) { l=Rank[l]; r=Rank[r]; if(l>r) swap(l,r); l++; int k=lg[r-l+1]; return min(minv[l][k],minv[r-(1<<k)+1][k]); } int main(){int c=0;while(scanf("%s",str)!=EOF){int i,j,k;if(str[0]=='#')break;n=strlen(str);build_sa(str,n+1,128);getHeight(str,n);init_lg();init_RMQ(n);int maxn=0,num=0;for(i=1;i<n;i++){for(j=0;j+i<n;j+=i){int k=lcp(j,j+i);int now=k/i;int tj=j-(i-k%i);if(tj>=0){if(lcp(tj,tj+i)>=i-k%i)now++;}if(now>maxn){num=0;ans[num++]=i;maxn=now;}elseif(now==maxn)ans[num++]=i;}}int flag=0,len,st;for(i=1;i<=n;i++){if(flag)break;for(j=0;j<num;j++){int temp=ans[j];if(lcp(sa[i],sa[i]+temp)>=maxn*temp){st=sa[i];len=temp*(maxn+1);flag=1;}}}printf("Case %d: ",++c);for(i=0;i<len;i++){printf("%c",str[st+i]);}printf("\n");}}
- POJ 题目 3693 Maximum repetition substring(后缀数组+RMQ+枚举求最小字典序的重复次数最多的子串)
- POJ - 3693 Maximum repetition substring(后缀数组求重复次数最多的连续重复子串)
- POJ 3693 Maximum repetition substring (后缀数组+RMQ 求重复最多的连续子串)
- POJ 3693 Maximum repetition substring (后缀数组+RMQ 求重复最多的连续子串)
- POJ 3693 Maximum repetition substring(重复次数最多的连续子串 字典序最小)
- Maximum repetition substring+POj+后缀数组之求重复次数最多的连续重复子串
- poj 1743Maximum repetition substring(后缀数组+RMQ+重复次数最多的连续重复子串))
- POJ 3693 Maximum repetition substring(后缀数组[重复次数最多的连续重复子串])
- HDU 2459 Maximum repetition substring(后缀数组+RMQ-重复次数最多的子串)
- POJ 3693 Maximum repetition substring 后缀数组求重复次数最多子串
- Poj 3693 & Hdu 2459 Maximum repetition substring (08合肥Online 后缀数组+RMQ 重复次数最多的连续重复子串)
- POJ 3693 Maximum repetition substring (求重复次数最多的连续子串,4级)
- poj 3693/hdu 2459 Maximum repetition substring spoj 687. Repeats ( 后缀数组 重复次数最多的连续重复子串)
- POJ-3693--后缀数组求字典序最小重复次数最多子串
- SPOJ题目687 Repeats(后缀数组+RMQ求重复次数最多的子串的重复次数)
- poj 3693 重复次数最多的连续重复子串(后缀数组+RMQ)
- poj3693Maximum repetition substring【后缀数组+RMQ求重复最多连续子串】
- POJ 3693 Maximum repetition substring(后缀数组求最长重复子串)
- c++实现单链表
- java填坑
- maven生成代码结构时XmlPullParserException异常
- nodejs 模板 ejs 入门 helloworld
- MySQL的管理,包括新建账户、基本信息查看
- POJ 题目 3693 Maximum repetition substring(后缀数组+RMQ+枚举求最小字典序的重复次数最多的子串)
- java.sql.SQLException: Incorrect string value: '\xE9\x99\xB6\xE4\xBC\x9F...' for column 'name' at ro
- 【Leetcode】Rotate Image
- Item 12:完整地拷贝对象(拷贝构造函数、复制运算符) Effective C++笔记
- 6.2 new 和 delete 运算符
- css的中英文对齐
- noip2001 car的旅行路线 (floyd求解最短路径长度)
- ImageView全屏
- linker command failed