2013年3月22日
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=3065AC自动机代码:#include<iostream>#include<cmath>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<stack>#include<queue>#include<set>#include<map>#include<algorithm>#define
阅读全文
posted @ 2013-03-22 17:07
夜->
阅读(162)
推荐(0)
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2896AC自动机ASCII可见字符是从 33~126代码:#include<iostream>#include<cmath>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<stack>#include<queue>#include<set>#include<map>#include<al
阅读全文
posted @ 2013-03-22 16:55
夜->
阅读(175)
推荐(0)
摘要:
http://acm.hdu.edu.cn/showproblem.php?pid=2222第一个AC自动机AC自动机就是在trie上进行kmp需要三个步骤1,建立trie2,求fail指针3,匹配代码:#include<iostream>#include<cmath>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<stack>#include<queue>#include<set>#in
阅读全文
posted @ 2013-03-22 10:01
夜->
阅读(183)
推荐(0)
2013年3月18日
摘要:
http://codeforces.com/contest/284/problem/E思维很重要呀 原来是一个背包呀代码:#include<iostream>#include<cmath>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<stack>#include<queue>#include<map>#include<set>#include<algorithm>
阅读全文
posted @ 2013-03-18 19:23
夜->
阅读(194)
推荐(0)
摘要:
http://codeforces.com/contest/284/problem/Ddp+记忆化搜索代码:#include<iostream>#include<cmath>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<stack>#include<queue>#include<map>#include<set>#include<algorithm>#define
阅读全文
posted @ 2013-03-18 16:39
夜->
阅读(366)
推荐(0)
2013年3月17日
摘要:
http://poj.org/problem?id=2513字典树+并查集+欧拉路代码:#include<iostream>#include<cmath>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<stack>#include<queue>#include<map>#include<set>#include<algorithm>#define long long
阅读全文
posted @ 2013-03-17 21:17
夜->
阅读(153)
推荐(0)
2013年3月14日
摘要:
http://poj.org/problem?id=3370鸽巢原理代码:#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<set>#include<map>#include<string>#include<queue>#include<stack>#include <iomanip>
阅读全文
posted @ 2013-03-14 19:56
夜->
阅读(144)
推荐(0)
摘要:
http://codeforces.com/contest/282/problem/D理解上去并不难 就是 博弈论 用 dp 实现但是用记忆化搜索时间复杂度太高 需要用递推 用奇异状态去更新非奇异状态 没被更新到的就是奇异状态这样的话只有奇异状态才去更新 奇异状态相比非奇异状态要少很多 所以节约了大量时间代码:#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#includ
阅读全文
posted @ 2013-03-14 12:29
夜->
阅读(280)
推荐(0)
摘要:
http://codeforces.com/contest/282/problem/B很水的题呀,结果比赛时没有想出来直接上代码:#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<set>#include<map>#include<string>#include<queue>#include<stack
阅读全文
posted @ 2013-03-14 12:23
夜->
阅读(212)
推荐(0)
2013年3月13日
摘要:
http://acm.timus.ru/problem.aspx?space=1&num=1032http://poj.org/problem?id=2356鸽巢原理代码:#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<vector>#include<set>#include<map>#include<string>#include<q
阅读全文
posted @ 2013-03-13 21:58
夜->
阅读(177)
推荐(0)