![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构
迪迪迪仔
这个作者很懒,什么都没留下…
展开
-
数据结构之最大子列和
#include <stdlib.h> #include <stdio.h> int MaxSubseqSum(int a[],int N) { int i,ThisSum = 0,MaxSum = 0; for(i = 0;i < N;i++) { ThisSum += a[i]; if(ThisSum &...原创 2018-10-31 21:50:33 · 177 阅读 · 0 评论 -
(Maximum Subsequence Sum )最大子列输出问题
Given a sequence of K integers { N1, N2, ..., NK }. A continuous subsequence is defined to be { Ni, Ni+1, ..., Nj } where 1≤i≤j≤K. The Maximum Subsequence is the continuous sub...原创 2018-11-01 11:05:33 · 349 阅读 · 0 评论