C++求子序列最大值.docVIP

#include iostream using namespace std; int MaxSum1(int n, int *a,int besti, int bestj); int summax(int n,int *a); int MaxSum2(int n, int *a); int MaxSubSum(int *a,int left, int right); int MaxSum(int n,int *a); int main() { int n,*a,besti,bestj,sum; coutPlease intput the number of elements:; cinn; a=new int[n];//申请内存空间； coutPlease input each elements:; //将所求的数输入数组 for(int i=1;i=n;i++) cina[i]; sum=MaxSum1(n,a,besti,bestj); coutMax sum is:sumendl; sum=summax(n,a); coutMax sum is:sumendl; sum=MaxSum2(n,a); coutMax sum is:sumendl; sum=MaxSum(n,a); coutMax sum is:sumendl; delete [] a; return 0; } //动态规划算法实现 int MaxSum(int n,int *a) { int sum=0,b=0; for(int i=1;i=n;i++){ if(b0) b+=a[i]; else b=a[i]; if(bsum) sum=b; } return sum; } //递推法 int summax(int n,int *a) { int i,j,t=0; int firsti; int b=0,sum=0; //递推 for(i=1;i=n;i++) { t=t+a[i]; if(t0) firsti=i; else firsti=1; } b=sum=a[firsti]; for(j=firsti+1;j=n;j++) { b=b+a[j]; if(bsum) sum=b; } return sum; } //简单算法实现，穷举 int MaxSum1(int n, int *a,int besti, int bestj) { int sum=0; for(int i=1;i=n;i++) for(int j=i;j=n;j++){ int thissum=0; for(int k=i;k=j;k++) thissum+=a[k]; if(thissumsum){ sum=thissum; besti=i; bestj=j; } } return sum; } //分治法 int MaxSum2(int n, int *a) { return MaxSubSum(a,1,n); } //分治法的具体实现 int MaxSubSum(int *a,int left, int right) { int sum=0; if(left==right) sum=a[left]0?a[left]:0; else{ int center=(left+right)/2; int leftsum=MaxSubSum(a,left,center); int rightsum=MaxSubSum(a,center+1,right); int s1=0; int lefts=0; for(int i=center;i=left;i--){ lefts+=a[i]; if(leftss1) s1=lefts; } int s2=0; int rights=0; for(int d=center+1;d=right;d++){ rights+=a[d ]; if(rightss2) s2=rights; } sum=s1+s2;