题解 | 最大子段和
最大子段和
https://www.nowcoder.com/practice/f04519cd1d904f50b68f4229a126ab08
#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll=long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin>>n;
ll curr=0,ans=-1e18;
for(int i=0;i<n;i++){
ll a;
cin>>a;
curr=max(a,curr+a);
ans=max(ans,curr);
}
cout<<ans;
return 0;
}
