摘要： /*KMP算法思想*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include <str 阅读全文

摘要： /*KMP 算法的应用这个题目可以这么理解，算出next[len]之后，那么根据重复字串的性质它有个必要条件是，len-next[len]的大小就是重复字串的长度，这是个必要条件如果这个条件不满足的话，那么它必定没有重复字串。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#includ 阅读全文

摘要： /*KMP算法KMP思想的精华是求模式串的失败函数，所谓的失败函数是指如果在匹配的过程失败了，模式串要返回到哪个位置。此时可以很明显的发现。加入此时是i位置匹配失败那么pattern[0...i-1]的某个前缀和某个后缀可能会相等。如果相等的话，那么我们就可以从这个前缀的下个位置开始搜，而不用从头开始搜这也是和暴力算法的蛮力搜高明的地方。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype& 阅读全文

摘要： /*rabin-karp算法基本思想是：把该字符集当成一个整数来看待比较字符串转化的整数来判断两个字符串是否相等对于这个题目，有几个疑问，N如果很大，那么int不就超了嘛，可是却能AC.理论上 应该去摸一个大质数的*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include < 阅读全文

摘要： /*利用字符串hash函数，一般常用的hash函数是BKDRhash.*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include < 阅读全文

摘要： // include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include <strstream># 阅读全文

摘要： /* 应该算个简单题*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bitset>#include <st 阅读全文

摘要： /*宽度优先搜索啥时候才能杜绝小错误呢，以后ij一定不在搞混了*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomanip>#include <bits 阅读全文

摘要： /*动归，自己开始没搞清楚，怎样来表达只有当休息为0的时候才继续跑步或者休息如果休息的话，不参与计算任务。*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#include <fstream>#include <iomani 阅读全文

摘要： /* 构图很关键，由于是开区间，所以可以把顶点之间的边当成是线段之间的点。 每条线段之间的边的容量定义为k,说明这个线段只能交叉k次。,k次之后就不能从这个线段交叉过去了。 好题*/// include file#include <cstdio>#include <cstdlib>#include <cstring>#include <cmath>#include <cctype>#include <ctime>#include <iostream>#include <sstream>#includ 阅读全文