- 博客(12)
- 收藏
- 关注
RSS订阅原创 最小循环表示
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;int gi
2017-07-14 12:31:14
374
原创 hiho-1014 Trie树 (Trie的建树与查询)
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;int gi
2017-07-14 10:20:41
233
原创 hdu-2222 Keywords Search (AC自动机板子题)
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;int gi
2017-07-14 10:16:07
196
原创 【NOIP2011】观光公交
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;int gi
2017-07-13 20:42:43
256
原创 后缀数组 (hihocoder重复旋律系列)
重复旋律1#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long longusing namespace std;
2017-07-13 13:08:16
269
原创 【NOIP2013】华容道
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;int gi
2017-07-08 22:47:53
201
原创 匈牙利算法
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;const
2017-07-05 22:40:20
133
原创 【NOIP2015】斗地主
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std;int gi
2017-07-04 15:56:33
275
原创 kmp（基本操作）
#include#include#include#include#include#include#include#include#include#include#define RG register#define IL inline#define pi acos(-1.0)#define ll long long using namespace std; int g
2017-07-02 17:26:35
302
原创 快速幂
#include #include #include #include #include #include #include using namespace std; int Qpow(int d, int z) { int A=1; while(z) { if(z&1) A=A*d; d*=d; z>>=1; } return A;}int main()
2017-07-02 17:24:37
138
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人