搜索资源列表
ACMcode
- acm pku的经典题目的代码和思路，包括了DP问题，贪心，回溯，等等都是很经典的题目
DP
- ACM.. 动态规划讲义从入门到精通，动态规划在程设中是很重要的一种算法
dp
- 动态规划教案，对于ACM初学者十分有价值-Dynamic programming lesson plans very valuable for beginners ACM
PKU1655
- PKU1655解题报告 动态规划算法、dp算法、ACM题-PKU1655 dynamic programming algorithm for solving the report, dp algorithm, ACM title
Zoozy090322
- ACM Templates, including useful Algorithms, Graph, Math, DP, Search, Data Structures and so on
IslandsandBridges
- Shanghai 2004 ACM ICPC world final Islands and Bridges 状态DP+汉密尔顿回路-Shanghai 2004 ACM ICPC world final Islands and Bridges State DP+ Hamilton circuit
2626Chess
- PKU 2626 Chess的问题解答，C++实现。 使用的是3维DP-It s a C++ solution for the problem-2626 in PKU ACM on-line judge.
DP
- ACM,DP有关资料，包括历届ACM夏令营的论文以及题目代码等-ACM, DP related information, including previous papers and the subject of summer camps ACM code, etc.
ACM-PKU-DP
- 在POJ上做的一些动态规划题，自己看吧。-In POJ do some dynamic programming problems, see for yourself.
acm-DP
- ACM 动态规划专题总结。。有好多例题什么的可以自己-ACM dynamic programming topic summary. .
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-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
Problem-Arrangement-zoj-3777
- zoj 3777，是我acm人生中的第一题状压dp，不得不承认这题很好，经典入门题。-zoj 3777, my first question acm life-like pressure dp, had to admit that this question is very good, classic entry title.
背包九讲-2.0
- 背包九讲，主要讲述DP相关的背包算法以备大家参考(Knapsack nine lectures, mainly about DP related knapsack algorithm, for your reference)
115073
- acm pku的经典题目的代码和思路,包括了DP问题,贪心,回溯,等等都是很经典的题目()
背包九讲
- 经典DP 背包问题，九讲背包入门，适合新手或入门者学习动态规划(The classic DP knapsack problem, the introduction of knapsack, is suitable for beginners or beginners to learn dynamic programming.)
3403907
- acm pku的经典题目的代码和思路,包括了DP问题,贪心,回溯,等等都是很经典的题目()