http://poj.org/problem?id=3261 给一个序列,求至少出现 k 次的最长重复子串,这 k 个子串可以重叠. 论文题+傻逼题. 上一道题(POJ1743)会做即可. 还是二分长度,按照高度数组分组做,统计每个组有多少个后缀即可. #include<algorithm> #include<iostream> #include<cstring> #include<cctype> #include<cstdio> #includ…

题面 vjudge Sol 二分答案+分组,判断有没有一个组的后缀个数不小于 k 做法 # include <bits/stdc++.h> # define IL inline # define RG register # define Fill(a, b) memset(a, b, sizeof(a)) using namespace std; typedef long long ll; const int _(20010); IL ll Read(){ RG char c = getcha…

http://poj.org/problem?id=3261 (题目链接) 题意 给出n个数和k,求在给出的数中,最长的出现至少k次的可重叠子串. solution 后缀数组论文题,感觉分组思想可能会有大用. 果断后缀数组,求出${sa,height,rank}$.二分答案,每次判断长度${mid}$是否符合出现${k}$次的要求.那么现在的问题是如何判断是否有一个长度为${mid}$的子串在原串中出现了至少${k}$次. 我们采用分组思想.将后缀${sa}$按照${height}$是否大于等于…

题意:求字符串的可重叠的k次最长重复子串 n<=20000 a[i]<=1000000 思路:后缀数组+二分答案x,根据height分组,每组之间的height>=x 因为可以重叠,所以只要判断是否有一组的height个数>=k即可 ..]of longint; n,m,i,l,r,mid,last,k1:longint; procedure swap(var x,y:longint); var t:longint; begin t:=x; x:=y; y:=t; end; fun…

题目链接:https://vjudge.net/problem/POJ-3261 Milk Patterns Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 17157   Accepted: 7592 Case Time Limit: 2000MS Description Farmer John has noticed that the quality of milk given by his cows varies f…

                                                                    Milk Patterns Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 13072   Accepted: 5812 Case Time Limit: 2000MS Description Farmer John has noticed that the quality of milk…

                                                    Milk Patterns 题意:求可重叠的至少重复出现k次的最长的字串长. 这题的做法和上一题差不多,也是先二分答案,然后将后缀分成若干组.不同的是,这里要判断的是有没有一个组的后缀个数不小于k.如果有,那么存在k个相同的子串满足条件,否则不存在.这个做法的时间复杂度为 O(nlogn). #include <map> #include <set> #include <q…

Milk Patterns Time Limit: 5000MS   Memory Limit: 65536K Total Submissions: 9274   Accepted: 4173 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,…

1717: [Usaco2006 Dec]Milk Patterns 产奶的模式 Time Limit: 5 Sec  Memory Limit: 64 MBSubmit: 1017  Solved: 561[Submit][Status][Discuss] Description 农夫John发现他的奶牛产奶的质量一直在变动.经过细致的调查,他发现:虽然他不能预见明天产奶的质量,但连续的若干天的质量有很多重叠.我们称之为一个“模式”. John的牛奶按质量可以被赋予一个0到1000000之间的…

Milk Patterns   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…