poj 3261 Milk Patterns 后缀数组 可重叠的k次最长重复子串
来源:互联网 发布:windows禁止启动程序 编辑:程序博客网 时间:2024/05/21 03:57
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
数据1e6 上板子
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int MAXN = 1e6+100;int t1[MAXN],t2[MAXN],c[MAXN];bool cmp(int *r,int a,int b,int l){ return r[a]==r[b]&&r[a+l]==r[b+l];}void da(int str[],int sa[],int ra[],int height[],int n,int m){ n++; int i,j,p,*x=t1,*y=t2; for(i=0;i<m;i++) c[i]=0; for(i=0;i<n;i++) c[x[i]=str[i]]++; for(i=1;i<m;i++) c[i]+=c[i-1]; 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; for(i=0;i<n;i++) if(sa[i]>=j) y[p++]=sa[i]-j; for(i=0;i<m;i++) c[i]=0; for(i=0;i<n;i++) c[x[y[i]]]++; for(i=1;i<m;i++) c[i]+=c[i-1]; 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]]=cmp(y,sa[i-1],sa[i],j)?p-1:p++; if(p>=n) break; m=p; } int k=0; n--; for(i=0;i<=n;i++) ra[sa[i]]=i; for(i=0;i<n;i++) { if(k) k--; j=sa[ra[i]-1]; while(str[i+k]==str[j+k])k++; height[ra[i]]=k; }}int ra[MAXN],height[MAXN];int sa[MAXN],num[MAXN];int n,k;int check(int x){ int i=1; while(i<n) { int j=i+1,cnt=0; while(j<=n&&height[j]>=x) { cnt++; j++; } if(cnt>=k-1) return 1; i=j; } return 0;}int main(){ while(scanf("%d%d",&n,&k)!=EOF) { // int maxn=0; for(int i=0;i<n;i++) { scanf("%d",&num[i]); // maxn=max(num[i],maxn); } num[n]=0; da(num,sa,ra,height,n,MAXN); int l=0,r=n; while(l<=r) { int mid=(l+r)>>1; if(check(mid)) l=mid+1; else r=mid-1; } printf("%d\n",l-1 ); }}
- POJ 3261 Milk Patterns ( 后缀数组 + 二分 可重叠的 k 次最长重复子串 )
- POJ - 3261 Milk Patterns (后缀数组求可重叠的 k 次最长重复子串)
- POJ 3261 Milk Patterns(后缀数组[可重叠的k次最长重复子串])
- poj 3261 Milk Patterns 后缀数组 可重叠的k次最长重复子串
- POJ 3261 Milk Patterns (离散化+后缀数组 可重叠k次最长重复子串)
- poj 3261 Milk Patterns (后缀数组 至少出现k次的可重叠最长重复子串)
- POJ 3261 Milk Patterns 求可重叠的 k 次最长重复子串(后缀数组)
- poj 3261 Milk Patterns 可重叠的k次最长重复子串 后缀数组da算法
- POJ 3261 Milk Patterns【后缀数组】可重叠的k次最长子串
- PKU3261(Milk Patterns)求可重叠k次的最长重复子串(后缀数组+二分)
- pku3261 Milk Patterns 后缀数组/可重叠的 k 次最长重复子串
- POJ 3261 Milk Patterns (离散化+后缀数组 k次最长重复子串(可重叠))
- POJ 3261 Milk Patterns(后缀数组 + 可重叠最长重复子串次数大于k)
- POJ 3261 Milk Patterns (可重叠的出现K次的最长重复子串)
- POJ 3261 Milk Patterns(可重叠的K次最长重复子串)
- poj 3261 Milk Patterns(可重叠的k 次最长重复子串)
- poj 3261 Milk Patterns 【求重复k次的最长可重叠子串】
- POJ 3261 Milk Patterns 可重叠的k次最长重复子串
- SecureCRT上传项目与部署
- iOS 开发小坑[持续更新]
- settimeout小记
- jQuery源码分析-----迭代器each
- HDU1052 Tian Ji -- The Horse Racing(贪心)
- poj 3261 Milk Patterns 后缀数组 可重叠的k次最长重复子串
- 【Hive Hbase】Hbase与Hive的区别与联系
- Hadoop之本地运行模式详解
- 用SSD训练自己的数据集
- 编译ffmpge
- Anaconda的安装与配置
- u-boot之ldr pc _start_armboot 解析
- 求十进制数n的 2至 n-1进制的表达
- frame搭建后台管理系统(点击左侧,右侧内容以选项卡方式出现)