2015年04月_HuanTongH

原创 poj 1816 Trie+DFS匹配模式串

Wild Words Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 4887 Accepted: 1274 Description A word is a string of lowercases. A word pattern is a string of

2015-04-26 12:06:21 502

原创 poj 2778 AC自动机+dp矩阵快速幂

DNA Sequence Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12628 Accepted: 4818 Description It's well known that DNA Sequence is a sequence only contains

2015-04-24 20:59:39 420

原创 hdu 2222 ac自动机模板题

Keywords Search Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 40636 Accepted Submission(s): 12942 Problem Description In the moder

2015-04-24 15:42:49 449

原创 poj 1236 强连通分量+缩点

Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12273 Accepted: 4887 Description A number of schools are connected to a computer network

2015-04-23 22:52:10 410

原创 poj 2774 后缀数组模板

求两个字符串的最长公共子串。将两个字符串连接为一个新字符串，并计算后缀数组和高度数组lcp。然后检查后缀数组中所有相邻的后缀，其中后缀分别属于第一和第二个字符串的lcp的最大值就是答案。 #include #include #include #include #include #include #include #include #include #includ

2015-04-21 23:52:14 465

原创 poj 3090 欧拉函数

Euler函数表达通式：euler(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…(1-1/pn),其中p1,p2……pn为x的所有素因数，x是不为0的整数。euler(1)=1（唯一和1互质的数就是1本身）。欧拉公式的延伸：一个数的所有质因子之和是euler(n)*n/2。参考http://blog.csdn.net/once_hnu/arti

2015-04-20 21:47:43 479

原创 hdu 3973 字符串hash+线段树动态维护

AC's String Time Limit: 30000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1091 Accepted Submission(s): 311 Problem Description You are given

2015-04-15 23:57:27 663

原创 poj 1997 trie树

Word Puzzle Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 1113 Accepted: 494 Description What a game collection it would be without famous and well kno

2015-04-14 18:01:20 561

原创 poj 3109 扫描线+bit

Inner Vertices Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 1815 Accepted: 479 Case Time Limit: 2000MS Description There is an infinite square gr

2015-04-12 10:22:49 627

原创 poj 2155 二维树状数组/区间更新单点查询

Matrix Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 20002 Accepted: 7481 Description Given an N*N matrix A, whose elements are either 0 or 1. A[i, j]

2015-04-08 18:07:18 554

原创 hdu 4819 二维线段树，单点修改区间查询

Mosaic Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others) Total Submission(s): 916 Accepted Submission(s): 402 Problem Description The God of sheep d

2015-04-08 17:39:13 1255 1

原创 poj 2887 块状数组/线段树

Big String Time Limit: 1000MS Memory Limit: 131072K Total Submissions: 5952 Accepted: 1405 Description You are given a string and supposed to do some string manipul

2015-04-03 23:36:33 1449

原创 hdu 4986 Arc of Dream 矩阵快速幂求递推式

Arc of Dream Time Limit: 2000/2000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 2534 Accepted Submission(s): 777 Problem Description An Arc of Drea

2015-04-03 00:07:32 531

写东西的地方