- 博客(3)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 后缀数组模版
int s[maxn];int sa[maxn], t[maxn], t2[maxn], c[maxn], n, k;int rank[maxn], height[maxn];void build_sa(int n, int m){ int i, *x = t, *y = t2; for(i = 0; i < m; i++) c[i] = 0; for(i = 0;
2014-10-18 21:14:54
665
原创 hdu 3498 whosyourdaddy（重复覆盖+估价函数剪枝）
whosyourdaddyTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1401 Accepted Submission(s): 699Problem Descriptionsevenzero liked
2014-10-04 22:52:04
881
原创 hdu 2828 Lamp（重复覆盖）
LampTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 846 Accepted Submission(s): 260Special JudgeProblem DescriptionThere are seve
2014-10-02 23:00:45
804
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人