- gcvoice_windows gc voice for testing E1
- popfax--printer Popfax printer is a driver that converts any document your desktop can print into a black and white TIFF FAX G3 format and then sends it to any fax machine via Popfax.com Internet fax services. Releases after 2.3 are maintained on Popfax.com own servers.
- key_board_2x2 用于输入的2x2键盘
- EditWS MU仓库编辑器 (转发)
- SeAr RO能开服的3转服务空端 下下来自己改下IP就能搞定
- maoxiandaoxiguai 冒险岛吸怪辅助*源码
文件名称:111
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.81kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
最长公共子序列求解
一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y,当另一序列Z既是X的子序列又是Y的子序列时,称Z是序列X和Y的公共子序列。最长公共子序列就是求给定两个序列的一个最长公共子序列。动态规划可以有效的解决此问题。由最长公共子序列问题的子序列的最优子结构性质,可以建立子问题最优的递归关系。用c[i][j]记录序列Xi和Yi的最长公共子序列的长度-Solving the longest common subsequence for a given sequence of sub-sequence is the sequence obtained by deleting a number of elements in the sequence. Given two sequences X and Y, while another sequence Z is X, Y promoter sequence is a sub-sequence, said sequence of X and Y Z is the common subsequence. Longest common subsequence is the sequence of the given one of the two longest common subsequence. Dynamic programming can effectively solve this problem. Longest common subsequence problem by the sub-optimal sequence of sub-structural nature of the problem can create sub-optimal recursive relationship. With c [i] [j] records series Xi and Yi, the length of the longest common subsequence
一个给定序列的子序列是在该序列中删去若干元素后得到的序列。给定两个序列X和Y,当另一序列Z既是X的子序列又是Y的子序列时,称Z是序列X和Y的公共子序列。最长公共子序列就是求给定两个序列的一个最长公共子序列。动态规划可以有效的解决此问题。由最长公共子序列问题的子序列的最优子结构性质,可以建立子问题最优的递归关系。用c[i][j]记录序列Xi和Yi的最长公共子序列的长度-Solving the longest common subsequence for a given sequence of sub-sequence is the sequence obtained by deleting a number of elements in the sequence. Given two sequences X and Y, while another sequence Z is X, Y promoter sequence is a sub-sequence, said sequence of X and Y Z is the common subsequence. Longest common subsequence is the sequence of the given one of the two longest common subsequence. Dynamic programming can effectively solve this problem. Longest common subsequence problem by the sub-optimal sequence of sub-structural nature of the problem can create sub-optimal recursive relationship. With c [i] [j] records series Xi and Yi, the length of the longest common subsequence
(系统自动生成,下载前可以参看下载内容)
下载文件列表
111.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.