最大子序列和

01-复杂度2 Maximum Subsequence Sum

#include
#include
using namespace std;
const int maxn = 10010;
int left=0,right=0;

int MaxSubswqSum(int A[],int N){
int ThisSum[maxn]={0},MaxSum=0,j=0,neg=0;
for(int i=0;i<N;i++){
if(A[i]<0) neg++;
ThisSum[j] += A[i];
if(ThisSum[j]>MaxSum){
MaxSum=ThisSum[j];
right = i;
left = j;
}
else if(ThisSum[j] < 0){
j = i+1;
ThisSum[j] = 0;
}
}
if(neg==N) return -1;
else return MaxSum;
}

int main(){
int k,n[maxn];
scanf("%d",&k);
for(int i=0;i<k;i++){
scanf("%d",&n[i]);
}
int sum = MaxSubswqSum(n,k);
if(sum==-1) printf(“0 %d %d”,n[0],n[k-1]);
else printf("%d %d %d\n",sum,left,right);
return 0;
}

有问题找不出，先标记