啊

注意常数优化（优化输出等）。#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>using namespace std;const int MAXN=2e5+10;int n,sa[MAXN],tmp[MAXN],rank[MAXN],sec[MAXN],cnt[MAXN],height[MA

题意是求可以重复的出现次数超过k次的子串，最长是多少。 样例输入 8 2 1 2 3 2 3 2 3 1 输出 4二分验证是否有连续的k-1个height大于所验证的答案。#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#define SZ 20005using nam

#include<set>#include<cmath>#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>#define maxn 500005#define LL long longusing namespace std;char s[maxn];set<int> S;set<int>

可以把原序列转化为差分序列，题意就变成了求这n个差分序列的最长公共子串。然后就可以连成一串，用后缀数组做。二分一个答案，询问是否有连续n个后缀LCP>=mid而且首位所属的串不相同。#include<cstdio>#include<cstring>#include<iostream>#define maxn 1100005using namespace std;void read(int

把整个前n-1个字符复制到字符串末尾，求个后缀数组搞就可以。#include<cstdio>#include<cstring>#include<iostream>#define maxn 200010using namespace std;char s[maxn];struct Suffix{ int sa[maxn],rank[maxn],height[maxn];