网站首页

登录

LongestIncreasingSequence

于 2011-09-05 发布文件大小:488KB

 0  89

下载积分: 1 下载次数: 2

我要下载

代码说明：

找出数组A中最长的递增序列的长度，使用动态规划算法，复杂度为O(N*N)。(Find the longest increasing sequence)

文件列表：

LongestIncreasingSequence
.........................\Debug
.........................\.....\LongestIncreasingSequence.exe,40448,2009-09-03
.........................\.....\LongestIncreasingSequence.ilk,382448,2009-09-03
.........................\.....\LongestIncreasingSequence.pdb,576512,2009-09-03
.........................\LongestIncreasingSequence
.........................\.........................\Debug
.........................\.........................\.....\BuildLog.htm,12230,2009-09-03
.........................\.........................\.....\LongestIncreasingSequence.exe.embed.manifest,663,2009-09-03
.........................\.........................\.....\LongestIncreasingSequence.exe.embed.manifest.res,728,2009-09-03
.........................\.........................\.....\LongestIncreasingSequence.exe.intermediate.manifest,621,2009-09-03
.........................\.........................\.....\main.obj,40073,2009-09-03
.........................\.........................\.....\mt.dep,69,2009-09-03
.........................\.........................\.....\vc90.idb,166912,2009-09-03
.........................\.........................\.....\vc90.pdb,208896,2009-09-03
.........................\.........................\LongestIncreasingSequence.vcproj,3970,2009-09-03
.........................\.........................\LongestIncreasingSequence.vcproj.REMUX.remex.user,1407,2009-09-03
.........................\.........................\main.cpp,1028,2009-09-03
.........................\LongestIncreasingSequence.ncb,1166336,2009-09-03
.........................\LongestIncreasingSequence.sln,941,2009-09-03

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

Kruskal
采用Kruskal算法求最小生成树主要数据结构 edgeset GE 存放图中的所有边 int n,int e 存放图中的顶点数与边数 edgeset C 存放生成树中的边 vexlist gv 图中结点的顶点值 adjmatrix s 用来处理图中结点的查找与合并 int m1,m2 一条边上两顶点所属集合的序号 int k 最小生成树中的边数 int d //图中待扫描边元素的下标(For the Minimum Spanning Tree by Kruskal main data structures edgeset GE store all edges in the figure int n, int e store graph vertices and edges edgeset C storage spanning tree edges in the vexlist gv graph node vertex values adjmatrix s used to process graph node to find and merge int m1, m2 an edge belongs to the set number two vertices int k minimum spanning tree edges int d // figure to be Scan edge element subscript)

2011-05-17 10:22:56下载

积分：1
ds3
单向链表的创建与操作设单向链表中节点的数据域的数据类型为整型，编写函数实现以下操作：（1）实现单向链表的创建（包括初始化）与输出操作，节点的个数及节点的数据由用户输入。（源代码：ds3-1.c）（2）查找给定的单链表中的第i个节点，并将其地址返回。若不存在第i个节点，则返回空地址。（源代码：ds3-2.c）（3）查找给定的单链表中值为n的节点，并将其地址返回。若不存在值为n的节点，则返回空地址。同时，还应通过参数传回该节点的序号。（源代码：ds3-3.c）（4）删除给定的单链表中的第i个节点，成功返回1，失败返回0。（源代码：ds3-4.c）（5）删除给定的单链表中值为n的节点，成功返回1，失败返回0。（源代码：ds3-5.c）（6）在给定的单链表的第i位上插入值为n的节点。（源代码：ds3-6.c）（7）在给定单链表的值为m的节点的前面插入一个值为n的节点。（源代码：ds3-7.c） (Creation and operation of a one-way linked list Set up a one-way linked list data type node integer data fields , write a function to achieve the following: ( 1 ) achieve the creation of a one-way linked list ( including initialization ) and output operation , the number of nodes and node data entered by the user . ( Source : ds3-1.c) ( 2 ) Find a single list given in the i-th node and returns its address . Without the presence of the i-th node , returns an empty address. ( Source : ds3-2.c) ( 3 ) Find a given node in a given value of n single list , and return address . Without the presence of the value of n nodes , returns an empty address. Meanwhile, the number should be returned by the parameters of the node . ( Source : ds3-3.c) ( 4 ) Delete the given singly linked list in the i-th node , the successful return 1, else return 0 . ( Source : ds3-4.c) ( 5 ) to delete a single node in the list is given n , the successful return 1, else return 0 . ( Source : ds3-5.c) ( 6 ) )

2014-05-11 19:19:41下载

积分：1
PolynomialCoeff
NTL应用——大数系数多项式乘法的计算。从文件读如参数，计算多项式相乘后某项的系数(NTL application- the multiplication of big numbers coefficient polynomial )

2021-04-11 09:58:58下载

积分：1
bTree
这是一个二叉树的工程文件，包括了工程文件里的所有文件。以及二叉树的构建，traverse，搜索等功能函数。(This file contains a summary of what you will find in each of the files that make up your bTree application. )

2011-05-20 08:12:04下载

积分：1
851DataStructure2009
江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)

2011-09-25 11:51:05下载

积分：1
Campus-navigation-problem
校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。要求：（1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。（2）为来访客人提供图中任意景点相关信息的查询。（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。（4）修改景点信息。 (Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path). Requirements: (1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information. (2) the figure for visiting any sites offering information about the query. (3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites. (4) modify the attractions information.)

2011-08-12 10:34:14下载

积分：1
InverseList
说明：链表逆转,实现单链表的逆转程序，数据结构(List Inverse)

2011-04-04 11:15:58下载

积分：1
xiao-yuan-dao-you
说明：设计济南大学校园平面图，所含的景点不少于10个。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。为来访客人提供图中任意景点相关信息的查询。为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。选作内容：求校园的关节点。提供图中任意景点查询，即求任意两点间的所有路径。校园导游图的景点和道路的修改扩充功能。扩充道路信息，如道路类别，沿途景色等级，一直可按客人所需分别查询人行路径或车行路径或观景路径。(Design jinan university campus plan, contains at least 10 spots in each vertex said in scenic spots, deposit attractions at the information such as the code name introduction On the path, deposit path length said related information )

2011-03-21 19:54:06下载

积分：1
CAR
some problems about c++.(car.cpp)

2012-01-12 14:39:48下载

积分：1
KMP
数据结构中KMP算法c语言实现，vc6.0环境(KMP algorithm in c language data structure, vc6.0 environment)

2013-03-27 14:04:39下载

积分：1

696524资源总数
103945会员总数
46今日下载