题目链接:https://leetcode.cn/problems/lian-xu-zi-shu-zu-de-zui-da-he-lcof/description/?favorite=xb9nqhhg
提示:
代码:
class Solution {
public:
const int maxn=1e5+100;
int dp[100005];
int maxSubArray(vector<int>& nums) {
dp[0]=nums[0];
for(int i=1;i<nums.size();i++)
{
if(dp[i-1]<0)
{
dp[i]=nums[i];
}
else dp[i]=max(dp[i-1]+nums[i],nums[i]);
}
sort(dp,dp+nums.size());
return dp[nums.size()-1];
}
};```