KMPAlgorithm package com.atguigu.sparsearray.kmp; import java.util.Arrays; public class KMPAlgorithm { public static void main(String[] args) { //TODO Auto-generated method stub String str1 = "BBC ABC DAB AB CD AB CD AB DE"; // String str2 = "AB CD ABD";...
classSolution{public:boolrepeatedSubstringPattern(strings){stringcp ="#"+ s;stringtxt ="#"+ s.substr(1) + s; txt.pop_back();vector<int>nxt(cp.size() +1,0);for(inti =2, j =0; i < cp.size(); i++){while(j && cp[i] != cp[j +1])j = nxt[j];if(cp[i] == cp[j...
回文树+二分+hash #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; typedef long long LL; typedef unsigned long long ULL; const int MAXN = 1000100; const int N = 26 ; struct Palindromic_Tree ...
//www.luogu.com.cn/problem/P3375// Memory Limit: 512 MB// Time Limit: 1000 ms/// Powered by CP Editor (https://cpeditor.org)#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<queue>#include<stack>#include<iomanip>#defineMAXN ...
#include<algorithm> using namespace std; #define INF (1<<30) #define MAXN 555555 const double PI=acos(-1.0); struct Complex{ double real,imag; Complex(double _real,double _imag):real(_real),imag(_imag){} Complex(){} Complex operator+(const Complex &cp) const{ ...
本来写了hashhash,发现没过,又写了一个KMPKMP,依旧WAWA,无奈去翻题解,竟然要取模??!! 题面怎么不讲啊,, #include<algorithm> #include<iostream> #include<cstring> #include<cstdio> #include<cmath> #include #define Redge(u) for (int k = h[u],to; k; k = ed[k].nxt) #define REP(i,...