基本求和:
#include <iostream>
#include <cstdlib>
#include <time.h>
using namespace std;
int maxSubSum(int *a,int n){
int max=0,b=0;
for(int i=0;i<n;i++){
if(b>0)
b+=a[i];
else
b=a[i];
if(b>max)
max=b;
}
return max;
}
void main(){
int a[10];
srand(time(NULL));
for(int i=0;i<10;i++){
a[i]=rand()%10+1-5;
cout<<a[i]<<" ";
}
cout<<endl;
cout<<"max sub sum: "<<maxSubSum(a,10)<<endl;
cout<<endl;
system("pause");
}
欢迎加QQ:算法交流群(538117042)