求解

#include<iostream>
using namespace std;
int main()
{
    long long n;
    cin>>n;
    long long a[200005]={};
    long long sum = 0;
    for(long long i = 1;i<=n;++i)
    {
        cin>>a[i];
        sum+=a[i];
    }
    long long ans = -1e9*1ll,ansm = 1e9*1ll;
    long long dp[200005] = {};
    dp[0] = 0; 
    for(long long i = 1;i<=n;++i) 
    {
        if(dp[i-1]>0)
        {
            dp[i]=dp[i-1]+a[i];
        }
        else
        {
            dp[i]=a[i];
        }
        ans = max(dp[i],ans);
        ansm = min(dp[i],ansm);
    }
    cout<<ans;
    return 0;
}