最大子序列问题的四种解法
//8 4 -3 5 -2 -1 2 6 -2
#include<stdio.h>
#include<stdlib.h>
int MaxSubsequenceSum_1(const int A[],int N);//三层循环o(n^3)
int MaxSubsequenceSum_2(const int A[],int N);//两层循环o(n^2)
static int MaxSubsequenc
原创
2017-01-12 10:21:03 ·
230 阅读 ·
0 评论