登录
首页 » Visual C++ » 3

3

于 2008-05-13 发布 文件大小:1KB
0 309
下载积分: 1 下载次数: 0

代码说明:

说明:  Description Michael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. ()

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • singlepoint
    说明:  全球定位系统单点定位程序,根据N文件和O文件解算地面点的坐标(Global positioning system, single point positioning procedure, in accordance with N documents and O document solver coordinates of ground points)
    2008-11-16 10:12:50下载
    积分:1
  • GPIBUtility
    GPIButility是ADLINK公司的GPIB驱动所带的工具软件,可以自动获得所有GPIB设备信息并可作相应的各项参数设置。(ADLINK' s GPIButility is brought GPIB driver software tool that can automatically access to all GPIB device information and can set the parameters accordingly.)
    2009-09-11 08:52:32下载
    积分:1
  • tongxunlu
    通讯录中的每一个信息包括姓名(规定字节数为15个)、电话(规定字节数为15个)和工作单位(最大字节数为30个)等信息。(Each information including the name of the mail list ( specified byte number 15 ), phone ( specified byte number 15 ) and work units ( the maximum number of bytes to 30 ) and other information.)
    2013-01-24 21:08:29下载
    积分:1
  • tree
    说明:  二叉树运用,简单背包问题,是本人初学数据结构的作业,(Bintree use, simple knapsack problem, is my data structure beginner operations,)
    2008-11-23 17:08:35下载
    积分:1
  • youxiangtu
    编写C程序,随机给出n*n的邻接矩阵,并打印输出邻接矩阵,以及有向图的边的个数,每个顶点的度,并判断该图中是否存在Euler回路: (1)如果为n阶,则随机产生一个n*n的邻接矩阵; (2)输出邻接矩阵,边的个数,每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点,一个是数据结构中的有向图的邻接矩阵的创建,还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
    2008-06-14 02:33:57下载
    积分:1
  • bintohex
    bin 格式转 hex 格式小程序,大家可以自己编译一下.(bin format to hex format applet, we can compile their own look.)
    2009-06-12 14:11:59下载
    积分:1
  • 2
    说明:  校园导游系统,是图的最短路径的应用 我短学期的课程小实验(Campus tour guide system, is the shortest path map application, I short-term courses of small experimental)
    2008-04-15 16:12:05下载
    积分:1
  • STACK
    用C语言编写的堆栈接口,适用于各种环境,提供接口: STACK *initStack(int MaxRoom) void destroyStack(STACK **spp) void resetStack(STACK *sp) Boolean isStackEmpty(STACK stack) Boolean isStackFull(STACK stack) Boolean push(STACK *sp, USER_TYPE data) Boolean pop(STACK *sp, USER_TYPE *data) Boolean readTop(STACK stack, USER_TYPE *data) (C language implementation of the stack)
    2013-07-22 10:59:32下载
    积分:1
  • clocktest
    获取系统时间 关于系统时间得获取以及显示界面(Access to the system time on the system time may access and display interface)
    2008-03-31 16:07:05下载
    积分:1
  • sy7
    一些简单的小例子,书上的例题代码,简单易懂,谢谢(Some simple examples, the book s example code, easy to understand, thank you)
    2013-10-19 11:00:18下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载