#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1e9+7;
const int INF=0x3f3f3f3f;
const int N = 1e6+10;
int a[N];int f[N];
#define ios ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
int maxx=0;
for(int i=1;i<=n;i++)
{
f[i]=max(f[i-1]+a[i],a[i]);
maxx=max(f[i],maxx);
}
cout<<maxx<<endl;
}
signed main()
{
int t;
t=1;
while(t--)
{
solve();
}
}
最大子串和
最新推荐文章于 2024-10-08 09:44:01 发布