1007. Maximum Subsequence Sum (25)

题目：1007. Maximum Subsequence Sum (25)
O(n^2)复杂度代码

#include<stdio.h>#include<malloc.h>int main(){    int n,i,j,maxsum=0,cursum=0;    int start=0,end=0,record=0;    scanf("%d",&n);    int *a=(int *)malloc(n*sizeof(int));    for(i=0;i<n;i++)scanf("%d",&a[i]);    for(i=0;i<n;i++)    {        cursum=0;        if(a[i]<0)        {            record++;            continue;        }        for(j=i;j<n;j++)        {            cursum+=a[j];            if(cursum>maxsum)            {                maxsum=cursum;                start=a[i];                end=a[j];            }        }    }    if(record==n)printf("0 %d %d",a[0],a[n-1]);    else printf("%d %d %d",maxsum,start,end);}