搜索资源列表
序列最大子段和
- 列出序列最大子段和的三种方法
NOI2005sequence
- splay实现维护序列区间翻转和最大子段和-splay sequence to achieve the maintenance interval and the largest sub-segment and flip
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
daima
- 压缩包里的事5段程序的代码，分别是斐波那契数列 最大子段和 最长公共子序列 矩阵连乘积 整数因子分解问题-Compression bag thing the program code, respectively, even the product of Fibonacci Fibonacci series the largest subsegment, and the longest common subsequence matri
Ruanfg1
- 最大子段和序列,求出所给数字序列的最大子段和，并输出到文件中。-The architectural segment and sequence
zuidaziduanhe
- 给定整数序列，用动态规划算法求出最大子段和，用c语言实现-Given the sequence of integers, find the maximum dynamic programming algorithm and sub-segment, with the c language