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
题意: 求重复次数至少为len的最长序列,序列可以重叠
思路:
一样的题:https://blog.csdn.net/tomjobs/article/details/102771283
直接枚举长度然后二分,将男人八题的那道题check函数改一下就可以了
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int SIZE = 1000000, INF = 1 << 30;
int a[SIZE];//真实值
int sa[SIZE];//以i为起始点后缀数组的排序
int rk[SIZE];//从i开始的后缀是第j名
int fir[SIZE];//
int sec[SIZE];//
int c[SIZE];//以i为关键字的数有j个
int h[SIZE];//LCP,最长公共前缀
char str[SIZE];//字符串
int n, p, len;
bool comp(int i, int j, int k)
{
return sec[i] == sec[j] && sec[i + k] == sec[j + k];
}
void sufarr(int n)
{
int i, p, l, m = 200;
for (i = 0;i < m;i++) c[i] = 0;
for (i = 0;i < n;i++) c[rk[i] = a[i]]++;
for (i = 1;i < m;i++) c[i] += c[i - 1];
for (i = n - 1;i >= 0;i--) sa[--c[a[i]]] = i;
for (l = p = 1;p < n;l *= 2, m = p)
{
for (p = 0, i = n - l;i < n;i++) sec[p++] = i;
for (i = 0;i < n;i++)
if (sa[i] >= l) sec[p++] = sa[i] - l;
for (i = 0;i < n;i++) fir[i] = rk[sec[i]];
for (i = 0;i < m;i++) c[i] = 0;
for (i = 0;i < n;i++) c[fir[i]]++;
for (i = 1;i < m;i++) c[i] += c[i - 1];
for (i = n - 1;i >= 0;i--) sa[--c[fir[i]]] = sec[i];
memcpy(sec, rk, sizeof(rk));
rk[sa[0]] = 0;
for (i = p = 1;i < n;i++)
rk[sa[i]] = comp(sa[i], sa[i - 1], l) ? p - 1 : p++;
}
}
void get_height()
{
int i, j, k = 0;
for (i = 1;i <= n;i++) rk[sa[i]] = i;
for (i = 0;i < n;h[rk[i++]] = k)
for (k ? k-- : 0, j = sa[rk[i] - 1];a[i + k] == a[j + k];k++);
}
int check(int n,int k)
{
int cnt = 1;
for (int i = 2; i <= n; i++)
{
if(h[i] >= k)//将h[i] >= k分成一组
{
++cnt;
if(cnt >= len)return 1;
continue;
}
cnt = 1;
}
return 0;
}
int main()
{
while(~scanf("%d %d", &n,&len))
{
for (int i = 0;i < n;i++) scanf("%d",&a[i]);
a[n] = 0;
sufarr(n + 1);
get_height();
int l = 1, r = n,ans = 1;
while(r - l >= 0)
{
int mid = (l + r) >> 1;
if (check(n, mid))
{
ans = mid;
l = mid + 1;
}
else r = mid - 1;
}
printf("%d\n",ans);
}
return 0;
}
HASH写法,hhh,字符串真好玩
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
typedef unsigned long long ull;
const int maxn = 2e4 + 7;
const int MOD = 10007;
struct HASHMAP
{
int head[MOD],nex[maxn],size;
ull state[maxn];
int f[maxn];
void init()
{
size = 0;
memset(head,-1,sizeof(head));
}
int insert(ull val,int id,int len)
{
int h = val % MOD;
for(int i = head[h];~i;i = nex[i])
{
if(val == state[i])
{
f[i]++;
if(f[i] >= len)
{
return true;
}
}
}
f[size] = 1;
state[size] = val;
nex[size] = head[h];
head[h] = size++;
return false;
}
};
HASHMAP H;
const int SEED = 13331;
ull p[maxn];
ull s[maxn];
int a[maxn],n,len;
bool check(int x)
{
H.init();
for(int i = x;i <= n;i++)
{
if(H.insert(s[i] - s[i - x] * p[x],i,len))return true;
}
return false;
}
int main()
{
p[0] = 1;
for(int i = 1;i < maxn;i++)
p[i] = p[i - 1] * SEED;
while(~scanf("%d %d",&n,&len))
{
for(int i = 1;i <= n;i++)scanf("%d",&a[i]);
for(int i = 1;i <= n;i++)
s[i] = s[i - 1] * SEED + a[i];
int l = 1,r = n,ans = -1;
while(r - l >= 0)
{
int mid = (l + r) >> 1;
if(check(mid))
{
ans = mid;
l = mid + 1;
}
else
{
r = mid - 1;
}
}
printf("%d\n",ans);
}
return 0;
}