搜索资源列表
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
dp
- 这是针对于 初学动态规划的程序员所设计的一套讲义。它深入浅出的讲解了动态规划的基本原理及其推广-failed to translate
DP
- 用c++编写的动态规划（DP）源程序。可用于水库调度等优化问题。-Using c++, prepared by Dynamic Programming (DP) source. And so can be used for reservoir operation optimization problem.
DP
- ACM,DP有关资料，包括历届ACM夏令营的论文以及题目代码等-ACM, DP related information, including previous papers and the subject of summer camps ACM code, etc.
DP
- 动态规划的常见题型，动态规划的分类，状态DP的常见分类以及转移方程-Frequently Asked Questions in dynamic programming, dynamic programming, classification, status, a common classification of DP and the transfer equation
dp
- 动态规划经典问题（1）问题中的状态必须满足最优化原理； （2）问题中的状态必须满足无后效性。 -dp
DP
- 有关动态规划DP的一些资料，包括两个学习动态规划的PPT,以及OJ的一些题目及解题代码，并附背包问题求解。-Dynamic programming DP on some of the information, including the two learning dynamic programming PPT, and OJ and solving some of the topics the code, together with Knapsack Problem.
DP
- 算法中的状态压缩Dp，十分的经典的DP方式，是程序员必须掌握的算法-State of compression algorithm Dp, the DP is the classic way, a programmer must master algorithm
pattren-matching-the-DP-algorithm
- pattren matching the DP algorithm
Dynamic-programming-DP-backpack
- 用动态规划算法解决DP背包问题，采用C++编程-Dynamic programming algorithm to solve the DP knapsack problem, using C++ programming
ACM-dp
- 关于ACM竞赛中经常出现的动态规划dp模板，有最大k段和，最大子段和-Dynamic programming dp template that often appear in ACM contest, the largest k segments, the largest sub-segment, and so on
DP
- 近年来，DP已成为NOIP中的“必考”项目，在06年的提高组题目中，甚至出现了两题DP（且该年分数线约为130分），DP的重要性可见一斑。-the data structure
To-Miss-Our-Children-Time-DP
- /*hdu4001To Miss Our Children Time DP 每块积木有四个参数a（长），b（宽），c（高），d（属性） d==0 它下面的积木为X a>=X.a b>=X.b d==1 a>=X.a b>=X.b&&(a>X.a||b>X.b) d==2 a>X.a&&b>X.b 所以先按长从小到大 再宽从小到大 属性从大到小排序 f[i]表示以第i个积木为顶的已搭积木的最大高度 */-/* Hdu400
DP
- DP是方向更新的ＯＭＰ算法，提高算法的运行速度。-DP updated direction OMP algorithm to improve the operating speed of the algorithm
DP-CPPM-Harding
- A UMAT of hardening DP-Model with closest point projection mehtod return mapping algorithm in ABAQUS Described in Chinese
DP
- DP算法的实现，通过matlab实现，绘图分类.-DP algorithm, through matlab implementation, drawing classification
DP
- DP简单例子：多源路径规划：求一座建筑物中每个电梯入口到所有电梯出口的最短路径-DP example：Multiple source shortest path
cPPand-DP
- 动态规划算法求解水库优化调度的C++程序，适用于水文专业或者水利专业的学生学习使用。-Use DP to solve reservoir operation problem
DP
- Dp is very good algorithm. You should try it.
dynamic programming
- 基础编程算法之DP贪心，从基础学起，成长大牛。(algorithm of greedy)