搜索资源列表
suanfafenxi
- 算法分析实验 java实现： 有： 公约数 合并算法 字符排序 快速排序 马踏棋盘问题 马踏棋盘问题（文本做法） 折半查找 最大子段和-algorithm analysis experiments java achieved : : Convention few characters sorting algorithm with Quick Sort horse riding horse riding c
MaxSubSum
- 最大子段和，实现了四种方法来求最大字段和
phoenix7
- 可以求最大子段和的优良代码,采用动态规划的方法求得,算法效率较高
序列最大子段和
- 列出序列最大子段和的三种方法
算法设计与分析源代码
- 包括：0-1背包.cpp 矩阵连乘.cpp 棋盘覆盖.cpp 整数划分.cpp 最大子段和
suanfafenxi
- 算法分析实验 java实现： 有： 公约数 合并算法 字符排序 快速排序 马踏棋盘问题 马踏棋盘问题（文本做法） 折半查找 最大子段和-algorithm analysis experiments java achieved : : Convention few characters sorting algorithm with Quick Sort horse riding horse riding c
MaxSubSum
- 最大子段和，实现了四种方法来求最大字段和-The largest sub-paragraph and, to realize the four methods for the largest fields and
phoenix7
- 可以求最大子段和的优良代码,采用动态规划的方法求得,算法效率较高-Can seek the largest sub-paragraph and the fine code, using dynamic programming methods to achieve the algorithm more efficient
MaxSum_ML
- 最大子段和实验之蛮力法，包括程序运行时间计算，C++表述-The largest sub-segment and experiments brute force method, including the run time calculation, C++ statements
ziduanhe
- 用蛮力，分治，动态递归算法设计最大子段和问题的算法及其分析-Use brute force, sub-rule, dynamic recursive algorithm design and problems in the largest sub-segment algorithm and its analysis of
suanfa
- 编程实现最大子段和问题的求解（分别采用分治法和动态规划法求解）。-Programming the largest sub-segment and the problem solving (respectively divide and conquer and dynamic programming method to solve).
NOI2005sequence
- splay实现维护序列区间翻转和最大子段和-splay sequence to achieve the maintenance interval and the largest sub-segment and flip
LargestSubsegmentSum3
- 用动态规划法求最大子段和 Java代码文件 -uegghrthwjqoei
algorithm2
- 最大子段和/三种方法/c++语言/(内有报告) 蛮力法，动态规划法，分治法。 可比较时间，随机输入数据...... -The largest sub-segment and/three methods/c++ language/(within report) brute force method, dynamic programming, divide and conquer. Comparable time, the rand
MaxSum
- 用动态规划算法完成最大子矩阵和问题，是最大子段和问题向二维的推广。-Complete with a dynamic programming algorithm and the largest sub-matrix problem, the problem is the largest sub-segment and the promotion of the two-dimensional.
maxsum
- 动态规划的经典例题，求一个序列的最大子段和问题。-The classic example of dynamic programming, find a sequence of the largest sub-segment and problems.
123
- 一、最长公共子序列问题；二，最大子段和问题（分治算法）-First, the longest common subsequence problem Longest common subsequence problems longest common subsequence problem Longest common subsequence problem
MaxSum
- 用蛮力法、分治法和减治法求最大子段和问题并比较运行时间。-With the brute force method, divide and conquer method for the treatment and reduce the largest sub-segment and the issues and compare the running time.
子段和问题
- 用贪婪法 动态规划法 分治法三种方法求解最大子段和问题(Solving the largest sub segment sum)
Maxsum
- 用蛮力法、分治法、动态规划法实现最大子段和(There is MaxSums in three way.)