poj 3261 Milk Patterns

Milk Patterns

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 4698		Accepted: 2012
Case Time Limit: 2000MS

Description

Farmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can't predict the quality of milk from one day to the next, there are some regular patterns in the daily milk quality.

To perform a rigorous study, he has invented a complex classification scheme by which each milk sample is recorded as an integer between 0 and 1,000,000 inclusive, and has recorded data from a single cow over N (1 ≤ N ≤ 20,000) days. He wishes to find the longest pattern of samples which repeats identically at least K (2 ≤ K ≤ N) times. This may include overlapping patterns -- 1 2 3 2 3 2 3 1 repeats 2 3 2 3 twice, for example.

Help Farmer John by finding the longest repeating subsequence in the sequence of samples. It is guaranteed that at least one subsequence is repeated at least K times.

Input

Line 1: Two space-separated integers:  N and  K 
Lines 2.. N+1:  N integers, one per line, the quality of the milk on day  i appears on the  ith line.

Output

Line 1: One integer, the length of the longest pattern which occurs at least  K times

Sample Input

8 2
1
2
3
2
3
2
3
1

Sample Output

4

Source

USACO 2006 December Gold

 

/* 可重叠的k次最长重复子串 二分即可 */ #include<iostream> #include<cstdio> #include<cstring> using namespace std; const int maxn=1010000; char str[maxn]; int wa[maxn],wb[maxn],wv[maxn],wn[maxn],a[maxn],sa[maxn]; int cmp(int* r,int a,int b,int l) { return r[a]==r[b]&&r[a+l]==r[b+l]; } //n为字符串长度，m为字符的取值范围，r为字符串。后面的j为每次排序时子串的长度 void DA(int* r,int* sa,int n,int m) { int i,j,p,*x=wa,*y=wb,*t; ///对R中长度为1的子串进行基数排序 for(i=0; i<m; i++)wn[i]=0; for(i=0; i<n; i++)wn[x[i]=r[i]]++; for(i=1; i<m; i++)wn[i]+=wn[i-1]; for(i=n-1; i>=0; i--)sa[--wn[x[i]]]=i; for(j=1,p=1; p<n; j*=2,m=p) { //利用了上一次基数排序的结果，对待排序的子串的第二关键字进行了一次高效地基数排序 for(p=0,i=n-j; i<n; i++)y[p++]=i; for(i=0; i<n; i++)if(sa[i]>=j)y[p++]=sa[i]-j; ///基数排序 for(i=0; i<n; i++)wv[i]=x[y[i]]; for(i=0; i<m; i++)wn[i]=0; for(i=0; i<n; i++)wn[wv[i]]++; for(i=1; i<m; i++)wn[i]+=wn[i-1]; for(i=n-1; i>=0; i--)sa[--wn[wv[i]]]=y[i]; ///当p=n的时候，说明所有串都已经排好序了 ///在第一次排序以后，rank数组中的最大值小于p，所以让m=p for(t=x,x=y,y=t,p=1,x[sa[0]]=0,i=1; i<n; i++) x[sa[i]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++; } return; } ///后缀数组 计算height数组 /** height数组的值应该是从height[1]开始的，而且height[1]应该是等于0的。 原因是，+因为我们在字符串后面添加了一个0号字符，所以它必然是最小的 一个后缀。而字符串中的其他字符都应该是大于0的（前面有提到，使用倍 增算法前需要确保这点），所以排名第二的字符串和0号字符的公共前缀 （即height[1]）应当为0.在调用calheight函数时，要注意height数组的范 围应该是[1..n]。所以调用时应该是calheight(r,sa,n) 而不是calheight(r,sa,n+1)。*/ int rank[maxn],height[maxn]; void calheight(int* r,int* sa,int n) { int i,j,k=0; for(i=1; i<=n; i++)rank[sa[i]]=i; for(i=0; i<n; height[rank[i++]]=k) for(k?k--:0,j=sa[rank[i]-1]; r[i+k]==r[j+k]; k++); return; } int main() { int n,k; while(scanf("%d%d",&n,&k)!=EOF) { for(int i=0; i<n; i++) scanf("%d",&a[i]); a[n]=0; DA(a,sa,n+1,maxn); calheight(a,sa,n);//height 1-->n //for(int i=1; i<n; i++) printf("%d ",height[i]); //printf("%d/n",height[n]); int fir=0,sec=n; int ans=0; while(fir<=sec) { int mid=(sec+fir)>>1; // printf("mid=%d/n",mid); bool flag=false; int num=0; for(int i=1; i<=n; i++) if(height[i]>=mid) num++; else { if(num+1>=k) { ans=mid; flag=true; } num=0; } if(num+1>=k) { ans=mid; flag=true; } if(flag) fir=mid+1; else sec=mid-1; } printf("%d/n",ans); } return 0; }