
##字符串
GDRetop
数据研发专家,ETL工程师
展开
-
hdu 5384 Danganronpa 2015多校联合训练赛#8 ac自动机
DanganronpaTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 171 Accepted Submission(s): 83Problem DescriptionDanganronpa is原创 2015-08-13 19:55:37 · 745 阅读 · 0 评论 -
HDU 5371 Hotaru's problem 2015多校联合训练赛7
Hotaru's problemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 243 Accepted Submission(s): 61Problem DescriptionHotaru Ichij原创 2015-08-11 18:54:27 · 815 阅读 · 0 评论 -
hdu 4899 Hero meet devil 2014多校联合训练赛 状态压缩dp 最长公共子序列
#include#include#include#includeusing namespace std;#define maxn 1<<15#define ll int#define mod 1000000007ll dp[2][maxn];int con[maxn][5];int ID[200];int value[20];char word[20];int queue原创 2014-08-04 16:02:49 · 1095 阅读 · 0 评论 -
hdu 3613 Best Reward回文子串Manocher算法
#include#include#define max(a,b) a>b?a:b#define min(a,b) a<b?a:b#define maxn 1000007int common[maxn];void Manocher(char *word,int len){ common[0] = 1; int p = 0,t=1,k,f; for(int i =原创 2014-08-01 14:09:10 · 800 阅读 · 0 评论 -
ac自动机系列
hdu 2234 考研路茫茫——单词情结原创 2014-08-01 10:24:34 · 612 阅读 · 0 评论 -
后缀自动机
spoj1811 #include#include#include#includeusing namespace std;#define maxn 510000struct Auto_Sufix{ int parent[maxn]; int child[maxn][26]; int len[maxn]; int last; int cn原创 2014-07-31 08:28:54 · 819 阅读 · 0 评论