Welcome![Sign In][Sign Up]
Location:
Search - 序列最大子段和

Search list

[VC/MFC序列最大子段和

Description: 列出序列最大子段和的三种方法
Platform: | Size: 2717 | Author: 461969382@qq.com | Hits:

[Windows DevelopmatrixChainproblem

Description: 在矩阵连乘问题、最长公共子序列、最大子段和等中选择一到两个,用C++语言(或其它语言)编程进行上机实验(可参考教材49-84页)。 1、问题描述: 给定n个矩阵{A1,A2,...,An},其中Ai与Ai+1是可乘的,i=1,2,...,n-1。考察这n个矩阵的连乘积A1,A2,...,An。 -Even in the matrix by the issue, the longest common subsequence, the largest sub-segment and so on, choose one or two, using C++ language (or other language) program to conduct experiments on the machine (which can refer to materials 49-84 pages). 1 Description of the problem: Given n matrices (A1, A2 ,..., An), where Ai and Ai+1 is a mere a, i = 1,2 ,..., n-1. This study n-matrices with the product of A1, A2 ,..., An.
Platform: | Size: 1024 | Author: 朱怡 | Hits:

[Mathimatics-Numerical algorithmsNOI2005sequence

Description: splay实现维护序列区间翻转和最大子段和-splay sequence to achieve the maintenance interval and the largest sub-segment and flip
Platform: | Size: 5120 | Author: LJJ | Hits:

[Data structsmaxsum

Description: 动态规划的经典例题,求一个序列的最大子段和问题。-The classic example of dynamic programming, find a sequence of the largest sub-segment and problems.
Platform: | Size: 1024 | Author: kql | Hits:

[Data structs123

Description: 一、最长公共子序列问题;二,最大子段和问题(分治算法)-First, the longest common subsequence problem Longest common subsequence problems longest common subsequence problem Longest common subsequence problem
Platform: | Size: 93184 | Author: 王海颖081 | Hits:

[Data structsdaima

Description: 压缩包里的事5段程序的代码,分别是斐波那契数列 最大子段和 最长公共子序列 矩阵连乘积 整数因子分解问题-Compression bag thing the program code, respectively, even the product of Fibonacci Fibonacci series the largest subsegment, and the longest common subsequence matrix Integer factorization issues
Platform: | Size: 2048 | Author: zhongming | Hits:

[OS programRuanfg1

Description: 最大子段和序列,求出所给数字序列的最大子段和,并输出到文件中。-The architectural segment and sequence
Platform: | Size: 524288 | Author: ruanfg | Hits:

[CSharpzuidaziduanhe

Description: 给定整数序列,用动态规划算法求出最大子段和,用c语言实现-Given the sequence of integers, find the maximum dynamic programming algorithm and sub-segment, with the c language
Platform: | Size: 891904 | Author: 林翔 | Hits:

CodeBus www.codebus.net