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 Ktimes.
Lines 2.. N+1: N integers, one per line, the quality of the milk on day i appears on the ith line.
8 2 1 2 3 2 3 2 3 1Sample Output
4
核心是怎样判断这个出现了k次的字符串,感觉就像是最大上升子序列。还有就是如何离散化,主要是因为一共20000个输入,可是他的取值范围确是打到了1e6,这样的话,就会很浪费空间和时间,所以我们先sort,然后map一下。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#define Rep(i,n) for(i=0;i<n;i++)
typedef long long ll;
using namespace std;
const int maxn=20010;
int s[maxn],tmp[maxn],t1[maxn],t2[maxn],c[maxn];
int sa[maxn],rank[maxn],height[maxn];
map<int,int> mp;
void get_sa(int s[],int n,int m)
{
int i,j,p,*x=t1,*y=t2;
Rep(i,m) c[i]=0;
Rep(i,n) c[x[i]=s[i]]++;
Rep(i,m) c[i+1]+=c[i];
for(i=n-1; i>=0; i--) sa[--c[x[i]]]=i;
for( j=1; j<=n; j<<=1) {
p=0;
for(i=n-j; i<n; i++) y[p++]=i;
Rep(i,n) if(sa[i]>=j) y[p++]=sa[i]-j;
Rep(i,m) c[i]=0;
Rep(i,n) c[x[y[i]]]++;
Rep(i,m) c[i+1]+=c[i];
for(i=n-1; i>=0; i--) sa[--c[x[y[i]]]]=y[i];
swap(x,y);
p=1;
x[sa[0]]=0;
for(i=1; i<n; i++)
x[sa[i]]=y[sa[i]]==y[sa[i-1]]&&y[sa[i-1]+j]==y[sa[i]+j]?p-1:p++;
if(p>=n) break;
m=p;
}
}
void get_height(int s[],int n)
{
int i,j,k=0;
for(int i=0; i<=n; i++) rank[sa[i]]=i;
Rep(i,n) {
if(k) k--;
j=sa[rank[i]-1];
while(s[i+k]==s[j+k]) k++;
height[rank[i]]=k;
}
}
int check(int maxl,int n,int k)
{
int cnt=1,ans=0;
for(int i=2; i<=n; i++) {
if(height[i]>=maxl){
cnt++;
ans=max(ans,cnt);//very important ,因为我不会
}
else
cnt=1;
}
//printf("maxl:%d ans:%d\n",maxl,ans);
return ans>=k?1:0;
}
int main()
{
int n,k;
scanf("%d %d",&n,&k);
for(int i=0; i<n; i++) {
scanf("%d",&s[i]);
tmp[i]=s[i];
}
tmp[n]=s[n]=-1;
sort(tmp,tmp+n+1);
int cnt=1;
for(int i=0; i<=n+1; i++)
if(!mp[tmp[i]]) mp[tmp[i]]=cnt++;
for(int i=0; i<=n+1; i++)
s[i]=mp[s[i]];
get_sa(s,n+1,cnt);
get_height(s,n);
int l=0,r=n,mid;
int ans=0;
while(l<=r) {
mid=(l+r)/2;
if(check(mid,n,k)) {
ans=mid;
l=mid+1;
} else
r=mid-1;
}
printf("%d\n",ans);
return 0;
}