搜索资源列表
AC
- 多模式匹配算法——AC算法 参考文献:AC算法:Aho A V,Corasick M J.Efficient string matching:an aid to bibliographic search.Communications of ACM,1975,18(6):333~340
template
- ACM及各类基本算法模板,包括数据结构,计算几何,字符串,图论,数学,高精度等许多常用模板-ACM basic algorithm and various templates, including data structures, computational geometry, string, graph theory, mathematics, high-precision, and many other commonly used templates
ACM
- 常用的算法代码(排序,字符串操作,数学问题,数论,计算几何等等)-Algorithm commonly used code (sorting, string operations, mathematical problem, number theory, computational geometry, etc.)
acm
- 字符串处理,动态规划,高精度个人小结,对初学算法竞赛有用-String handling, dynamic programming, high-precision individual summaries, helpful for beginners algorithm competition
Accepted
- 浙大acm题: Beautiful Meadow.cpp Big String Outspread.cpp Image Transformation.cpp palindromes.cpp Sum Up.c-Zhejiang University acm title: Beautiful Meadow.cpp Big String Outspread.cpp Image Transformation.cpp palindromes.cpp Sum Up.cpp
string-in-acm
- 总结了ACM中出现的关于字符串的题目,并提供了实现源码,是word文档格式,大家放心下载-ACM summarized on the string appears in the title, and provides implementation source code for a word document format, download we be assured
hdu1297
- 杭电acm1297 #include<stdio.h> #include<string.h> #define m 1002 int f[m][70]={{1,1},{1,1},{1,2},{1,4}} void add(int p[],int q[],int sum[]) { int i,len if(p[0]<q[0])len=q[0] else len=p[0] for(i=1 i<=len i++)
KMP
- 字符串处理之KMP算法,适用于参加ACM程序设计竞赛的同学-The KMP string processing algorithm applied to participate in ACM Programming Contest for students
ACM
- acm超级经典的算法。内容包括河内塔 费式数列 巴斯卡三角形 三色棋 老鼠走迷官(一) 老鼠走迷官(二) 骑士走棋盘 八个皇后 八枚银币 生命游戏 字串核对 双色、三色河内塔 背包问题(Knapsack Problem) 数、运算 蒙地卡罗法求 PI 等等。-acm super classic algorithms. Including Hanoi Tower Fei-style Liebasika tri
acm_stirng
- acm/icpc比赛中有关字符串问题的模板-the model about string in acm/icpc