首页 > 其他 > 详细

01-复杂度2 Maximum Subsequence Sum (25分)

时间:2015-09-04 17:02:11      阅读:214      评论:0      收藏:0      [点我收藏+]
#include <stdio.h>
void MaxSubsseqSum1(int A[], int N) {
    int ThisSum = 0, MaxSum = -1;
    int start,end;
    int temp = 0;
    for (int i = 0; i<N; i++) {
        ThisSum += A[i];
        if (ThisSum>MaxSum){
            MaxSum = ThisSum;
            start = temp;
            end = i;
        } else if (ThisSum<0) {
            ThisSum = 0;
            temp = i+1;
        }
    }
    if (MaxSum>=0) {
    printf("%d %d %d\n",MaxSum, A[start], A[end]);
    } else {
        printf("0 %d %d\n", A[0], A[N-1]);
    }
    }
int main(void) {
    int N;
    scanf("%d",&N);
    int A[N];
    for (int i = 0; i<N;i++) {
        scanf("%d",&A[i]);
    }
    MaxSubsseqSum1(A, N);
}

 

01-复杂度2 Maximum Subsequence Sum (25分)

原文:http://www.cnblogs.com/sjdeak/p/4781841.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!