摘要： 题目：http://acm.hdu.edu.cn/showproblem.php?pid=1686大意：求模式串在主串出现的次数。。（可以重复）#include <iostream>#include <string>using namespace std;const int L1 = 1000010;const int L2 = 10010;char s[L1], p[L2];int nxt[L2], l1, l2;int res;void GetNext(){ int k = -1, j = 0; nxt[0] = -1; while (j < l2) { .. 阅读全文

摘要： 题目：http://acm.hdu.edu.cn/showproblem.php?pid=1711把字符数组转成整形数组。。。然后我们本来是从0开始的，，，他要的是从1开始。。。。。#include <iostream>#include <string>using namespace std;const int L1 = 1000010;const int L2 = 10010;int s[L1], p[L2];int nxt[L2], l1, l2;int res;void GetNext(){ int k = -1, j = 0; nxt[0] = -1; whil 阅读全文

摘要： 题目：http://acm.hdu.edu.cn/showproblem.php?pid=2087#include <iostream>#include <string>using namespace std;#define L1 1001#define L2 1001char s[L1], p[L2];int nxt[L2], l1, l2;int res;void GetNext(){ int k = -1, j = 0; nxt[0] = -1; while (j < l2) { if (k == -1 || p[j] == p[k]) ... 阅读全文