HDU - 1711 Number Sequence KMP模板题

HDU - 1711 Number Sequence

#include
#include
#include
using namespace std;
const int maxn=1000010;
int nxt[maxn];
int a[maxn],b[maxn];
int n,m;
void getnext()    //求 nxt[]
{
    int i,j;
    i = 0;
    j = nxt[0] = -1;
    while(i

 

你可能感兴趣的:(HDU - 1711 Number Sequence KMP模板题)