Collider

利用KMP算法对该字符串处理计算出它的部分匹配表（next） 利用next求出它的循环节。#include <cstdio>const int maxn = 1000000 + 10;char s[maxn];int next[maxn];int n;void get_next() { int k = 0; next[0] = 0; for (int q = 1; q <

用KMP的next部分匹配表寻找最小的字符串周期。//POJ2406#include <cstdio>#include <iostream>#include <string>using namespace std;const int maxn = 1000000 + 10;int n;string s;int list[maxn];void getnext() { list[0]

搏一搏，单车变摩托！ 虽然是KMP但是可以暴力水过。#include <cstdio>#include <cstring>const int maxn = 1000000 + 5;const int maxm = 1000000 + 5;int a[maxn];int b[maxm];int main(int argc, char const *argv[]) { int T;