搜索资源列表
suffarray_c
- 后缀数组求最长公共子串 这里的最长公共子串是指的连续的子串，并非经典dp的那种。 aabbc abc 这两个字符串的最长公共子串为ab 算法复杂度是o(n)的（n为两个字符串长度的和）-suffix array for the longest string of public-public here - the longest string of consecutive refers to the substring. dp is not the
dp
- (1).问题描述：旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要 选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（ 或旅费）最小。 (2).程序设计要求： a. 设计一个动态规划算法 b. 任给一个输入实例，能输出最短路程及其路线 c. 能用图形演示旅行商的推销路线 输入要测试的文件名，如TSP6.txt,程序将利用动态规划求解该问题，给出最佳线 路，并用图形演示。
DP.rar
- 最长路径DP算法 根据邻近矩阵,再运用DP算法计算出图中任意节点间的最长路径,有点类似于最短路径算法,DP algorithm for the longest path in accordance with the neighboring matrix, re-use of DP algorithm to calculate arbitrary graph the longest path between nodes, somewhat similar to the shortest path
01knapsackMFC
- 01背包问题演示程序 用mfc实现01背包问题的dp算法-01 knapsack problem with mfc demo program to achieve 01 knapsack problem algorithm dp
PKU1655
- PKU1655解题报告 动态规划算法、dp算法、ACM题-PKU1655 dynamic programming algorithm for solving the report, dp algorithm, ACM title
fulltext1
- 一篇关于模式匹配的英文论文，该文采用了DP比对算法-A pattern-matching English paper, using DP matching algorithms
dp
- 介绍动态规划 资料列举了若干应用实例，有分析以及算法实现便于学习-Information on dynamic programming, introduced a number of application examples cited, some analysts, as well as facilitate the learning algorithm
PinDp
- 一种动态规格算法，所谓的插头dp，提供详细的分析，另附带一道练习。-This document is about a dynamic programming method, providing Detailed analysis and code.
DP
- 算法设计的经典问题，动态规划算法，实现0-1背包问题-Classic problem of algorithm design, dynamic programming algorithm to achieve the 0-1 knapsack problem
Mesh
- 摘要：针对传统的DP算法存在条纹瑕疵，提出了一种改进的垂直性约束动态规划立体匹配算法，通过利用扫描线间的相关信息来约束动态规划过程，使得处理每一条扫描线时都能充分利用以前扫描线的匹配信息。实验结果表明，该算法可以明显地消除传统DP算法的视差图的条纹瑕疵，匹配精度高, 而且执行时间短。-ABSTRACT Although network speed has been increased over the years,bandwidth limitation continues to pos
Lecture-of-Dynamic-Programming-(DP)
- 上算法设计课课同学自己准备的讲座，ppt通过举例详细介绍了动态规划的原理，并附有实现源码与测试数据-Division on the algorithm design students prepare their own lectures, ppt described in detail by way of example the principles of dynamic programming, together with source code and test data to achiev
dp
- 动态规划算法中的四边形不等式定理证明以及应用-Dynamic programming algorithm
Dynamic-programming-DP-backpack
- 用动态规划算法解决DP背包问题，采用C++编程-Dynamic programming algorithm to solve the DP knapsack problem, using C++ programming
dp-problem
- 这个包括了 ACM比赛中 经常会用到的动态递归算法的一些经典例题，例如背包问题，最长公共子序列等的源代码-This includes the classic example of the dynamic recursive algorithm is often used in the ACM competition, such as the knapsack problem, the longest common subsequence such as source code
Knapsack-problem(DP)
- 本文档详细分析了动态规划的经典模型-背包问题，能够有效强化对该类型算法的理解。-This document is a detailed analysis of the classic model of the dynamic programming- knapsack problem, can effectively enhance the understanding of this type of algorithm.
1293xoj
- 这是XOJ1293的代码，主要应用了二分图匹配的dp算法。-The code of XOJ1293 bipartite graph matching algorithm of dp main application.
dp-algorithm
- 经典算法——动态规划教程，很详细的教程资料，长达70多页，很好很强大。-Classical algorithm- dynamic programming tutorial, a very detailed tutorial information as long as 70 pages, very very powerful.
DP
- 动态规划算法的编程实现，重在思想吧，代码也不多。-Dynamic programming algorithm programming, focusing on thinking it, the code is not much.
DP
- 动态规划加速原理之四边形不等式 可以大幅降低动态规划的算法复杂度-Acceleration principle of dynamic programming quadrilateral inequalities. Can significantly reduce the complexity of the dynamic programming algorithm.
DP
- 2014年北京大学暑假公开课算法讲解课件之动态规划，讲解详细，分析透彻-2014 Peking University summer open class courseware of the dynamic programming algorithm to explain, explain in detail, thorough analysis