PTA实例1.1 最大子列和问题 (20 分)

//算法二
//穷举式 运行时间 O(N*N)
#include<stdio.h>
int MaxSubSequenceSum(int A[],int N);
void main()
{
    int i,N;
    scanf("%d",&N);
    int A[N];
    for(i=0;i<N;i++){
        scanf("%d",&A[i]);
    }
    printf("%d\n",MaxSubSequenceSum(A,N));
}
int MaxSubSequenceSum(int A[],int N)
{
    int i,j,ThisSum,MaxSum;
    MaxSum=0;
    for(i=0;i<N;i++){
        ThisSum=0;
        for(j=i;j<N;j++){//循环累加后面的每一项，找出并替换最大的那一个  
            ThisSum+=A[j];
            if(ThisSum>MaxSum){
                MaxSum=ThisSum;
            }
        }
    }
    return MaxSum;
}

//算法三
//采用分治策略，递归的对他们求解 运行时间 O(NlogN)
#include<stdio.h>
int MaxSubSequenceSum(int A[],int N);
int MaxSubSum(int A[],int Left,int Right);
int Max3(int a,int b,int c);
void main()
{
    int i,N;
    scanf("%d",&N);
    int A[N];
    for(i=0;i<N;i++){
        scanf("%d",&A[i]);
    }
    printf("%d\n",MaxSubSequenceSum(A,N));
}
int MaxSubSequenceSum(int A[],int N)
{
    return MaxSubSum(A,0,N-1);
}
int MaxSubSum(int A[],int Left,int Right)
{
    int MaxLeftSum,MaxRightSum;
    int MaxLeftBordenSum,MaxRightBordenSum;
    int LeftBordenSum,RightBordenSum;
    int Center,i;
    if(Left==Right)//只有一个元素时
        if(Left>0)
            return A[Left];
        else
            return 0;
    Center=(Left+Right) / 2;
    MaxLeftSum=MaxSubSum(A,Left,Center);//递归调用
    MaxRightSum=MaxSubSum(A,Center+1,Right);//递归调用
    MaxLeftBordenSum=0; LeftBordenSum=0;
    for(i=Center;i>=Left;i--){//计算到达中间分界线处的两个最大和的和数
        LeftBordenSum+=A[i];
        if(LeftBordenSum>MaxLeftBordenSum)
            MaxLeftBordenSum=LeftBordenSum;
    }
    MaxRightBordenSum=0; RightBordenSum=0;
    for(i=Center+1;i<=Right;i++){
        RightBordenSum+=A[i];
        if(RightBordenSum>MaxRightBordenSum)
            MaxRightBordenSum=RightBordenSum;
    }
    return Max3(MaxLeftSum,MaxRightSum,MaxLeftBordenSum+MaxRightBordenSum);
}
int Max3(int a,int b,int c)
{
    int max;
    max=(a>b?a:b)>c?(a>b?a:b):c;
    return max;
}

//算法四
//采用在线处理，联机算法 运行时间 O(N)
//联机算法：在任意时刻，算法都能对他已经读入的数据给出子序列问题的正确答案
#include<stdio.h>
void main()
{
    int i,N;
    scanf("%d",&N);
    int A[N];
    for(i=0;i<N;i++){
        scanf("%d",&A[i]);
    }
    printf("%d\n",MaxSubsequenceSum(A,N));
}
int MaxSubsequenceSum(int A[],int N)
{
    int j,ThisSum,MaxSum;
    ThisSum=MaxSum=0;
    for(j=0;j<N;j++){
        ThisSum+=A[j];
        if(ThisSum>MaxSum){
            MaxSum=ThisSum;
        }else if(ThisSum<0)
            ThisSum=0;
    }
    return MaxSum;
}