- 博客(2)
- 收藏
- 关注
RSS订阅原创 The Maximum Subarray Problem
Given an array A, we want to find the nonempty, contiguous subarray of A whose values have the largest sum. This problem is called the maximum subarray problem. For example, let A[16]={13,-3,-25,20,-3
2013-08-29 09:09:05
495
转载 inorder
#include #include #include #include #include #define MAX 100 typedef struct tnode { int data; struct tnode *lchild,*rchild; }TNODE; void create(); void insert(int ); /*插入结点*/ void inorde
2013-08-29 09:01:30
598
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人