suzhigao的博客

求给定N个整数的序列{A1,A2,……,An},求函数 f(i,j)=max{0,∑(i→j)Ak}的最大值 算法1 直接暴力求出每个子序列和的值，然后取最大的值。时间复杂度为O(n^3) int MaxSubseqSum1(int A[], int N) { int ThisSum, MaxSum = 0; int i, j, k; for (i = 0; i < N; i ...

#include <iostream> #include <malloc.h> using namespace std; #define MAXL 100 typedef int KeyType; typedef char InfoType; typedef struct { KeyType key;//关键字 InfoType data;//其他数据项 }Rec...

#include <iostream> #include <malloc.h> using namespace std; #define MAXL 100 typedef int KeyType; typedef char InfoType; typedef struct { KeyType key;//关键字 InfoType data;//其他数据项 }Rec...

#include <iostream> #include <malloc.h> using namespace std; #define MAXL 100 #define MAXI 20 typedef int KeyType; typedef char InfoType; typedef struct { KeyType key;//关键字 InfoType d...