搜索资源列表
vijos1003
- vijos1003-等价表达式解题报告,非常详细,请下载,测试通过-equivalent expression vijos1003-solving report, very detailed, please download, test
three_methods_sort
- 三种排序算法比较,冒泡算法,选择算法,快速算法。-Comparison of three sorting algorithms, bubble algorithm selection algorithm, fast algorithm.
pxtree
- 每一个参加排列的数据对应二叉树的一个结点,且任一结点如果有左(右)子树,则左(右)子树各结点的数据必须小(大)于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data
li1
- 设有由n个不相同的整数组成的数列,记为: a(1)、a(2)、……、a(n)且a(i)<>a(j) (i<>j) 例如3,18,7,14,10,12,23,41,16,24。 若存在i1<i2<i3< … < ie 且有a(i1)<a(i2)< … <a(ie)则称为长度为e的不下降序列。如上例中3,18,23,24就是一个长度为4的不下降序列,同时也有3,7,10,12,16,24长度为6的不下降序列。程序要求,当原
hymain
- 一套反出来的股票分析软件,对于分析程序结构和数据结构有一定的帮助.-By a set of anti-stock analysis software for the analysis of program structure and data structure have some help.
cvery_60718854
- 货郎担问题属于易于描述但难于解决的著名难题之一,至今世界上还有不少人在研究它。-TSP
pack
- 背包问题专项训练 动态规划算法 有题目的C++解法-Knapsack problem dynamic programming algorithm C++ Solution
RIPprogram
- a RIP distance vector implementation for a simple graph
poj01
- poj acm 1664 2694 2749 2816 递归算法部分题解~~很经典的递归应用-poj acm 1664 2694 2749 2816 recursive algorithm for part of the problem solution ~ ~ a very classic recursive application of
pku
- pku1015源代码,北大acm题库,动态规划-pku1015 source code, Peking University acm item bank, dynamic programming
eliminarunnodo
- Delete a node from a tr-Delete a node from a tree...
PROED
- VOJOS上很多模拟赛的解题报告,标程,我的源码,数据,会对NOIP很有帮助的-VOJOS many simulated problem-solving tournament reports, standard way, my source code, data, would be helpful NOIP
dynamic
- 动态规划算法的一些归纳和应用,方便各位学习用,有背包问题,最长公共字串问题,等。-Some of induction dynamic programming algorithm and applications, ease of learning to use, there are knapsack problem, the longest string of public issues, and so on.
DynamicProgramming
- 包含了7篇与动态规划相关的论文及附件: 基本动态规划问题的扩展----2001俞伟论文 动态规划算法的优化技巧---2001毛子青论文 动态规划的特点及其应用----2000张辰论文 动态规划的深入讨论---2000李刚论文 动态规划的深入探讨----1999来煜坤论文 动态规划的个性化优化----2003项荣璟论文 动态规划----2000方奇论文-Contains 7 and the dynamic programming-related papers and a
Code
- Ural 源码-Ural Source Code.............
2006_ACM
- 2006年ACM国家集训队论文集.包含了很多种算法的抽象和讲解。-2006 ACM National Team TECHNOLOGY. Contains many types of algorithms and abstract explanation.
hanoibfs
- 用广度搜索编的汉诺塔问题,能解决14个盘子的,用到位运算压缩判重,用哈希表判重。-The Tower of Hanoi with the breadth of search code problem, can solve the 14 dishes, with a compression sub-re-place operations, using the hash table sub-weight.
8numcant
- 广度搜索八数码问题,用康托展开判重,哈希表的思想。-BFS 8 digital issues, with Cantor re-start negotiations, hash table ideas.
string_structure
- 关于字符串的数据结构应用,有kmp,扩展kmp,单词前缀树的近似kmp,后缀数组。求最多重复子串。-On the string data structure applications, kmp, expansion kmp, word prefix tree approximation kmp, suffix array. Seeking up to repeated substring.
graphy_theory
- 关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配,弦图判定,一般图最大匹配,有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed