最大子序列和

来源:互联网 发布:wow.js下载 编辑:程序博客网 时间:2024/05/18 17:43
#include <stdio.h>#include<time.h>#define MAX 100000int MaxSubsequenceSum(int A[], int N){    int ThisSum, MaxSum = 0;    int i, j;    for (i = 0; i <= N; i++) 
    {        ThisSum = 0;        for (j = i; j <= N; j++) 
{            ThisSum += A[j];            if (ThisSum > MaxSum)                MaxSum = ThisSum;        }    }    return MaxSum;}int main(void){    int i;    long int k = 0;    int arr[MAX] = { 0 };    scanf("%d", &k);    for (i = 0; i < k; i++)    {        scanf("%d", &arr[i]);    }    printf("%d ", MaxSubsequenceSum(arr, k));    return 0;}

原创粉丝点击