DK

题意：找到两个字符串最长前缀后缀匹配。比并且是输出字符串较小的。#include <iostream>#include <cstdio>#include<limits>#include <map>#include <cstring>#include <string>#include <cstdlib>using namespace std;const int MAXN=100005;

#include #include #include#include #include #include #include using namespace std;const int N = 1000005;char patter[10005], origin[N];int Next[10005];void getnext(){ int i, j;