KMP
文章平均质量分 57
Griffin_0
这个作者很懒,什么都没留下…
展开
-
poj3461-Oulipo
#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 10050typedef long long ll;#define FOR(i,j,n) for(int i=j;i<=n;i原创 2015-08-24 19:08:05 · 335 阅读 · 0 评论 -
poj2752-Seek the Name, Seek the Fame
//要充分了解next数组所代表的含义#include#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 400100typedef long long ll;#defin原创 2015-08-24 20:40:27 · 343 阅读 · 0 评论 -
hdu1686 Oulipo (KMP)
#include#include#include#include#include#include#include#include #include #include #include #include #include#define Maxn 10050typedef long long ll;#define FOR(i,j,n) for(int i=j;i<=n;i原创 2015-10-23 19:29:57 · 359 阅读 · 0 评论