最大序列和

#include <iostream>
#include <cstdio>
using namespace std;

int MaxSubsequence(int arr[],int n){
    int dp[100];
    int maximum;
    for(int i = 0;i < n; i++){
        if(i == 0){
            dp[i] = arr[i];
            maximum = arr[i];
        }else{
            dp[i] = max(dp[i-1] +arr[i],arr[i]);
        }
        maximum = max(maximum,dp[i]);
    }
    return maximum;
}
int main(){
    int n;
    int arr[100];
    while(scanf("%d",&n) != EOF){
        for(int i = 0;i < n;i ++){
            scanf("%d",&arr[i]);
        }
        int maximum = MaxSubsequence(arr,n);
        printf("%d\n",maximum);

    }
    return 0;
}