Sword finger offer 42 Maximum sum of successive subarrays

The finger of the sword Offer 42. The maximum sum of successive subarrays

subject

Code

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

int maxSubArray(vector<int>& nums) {
    
	int n = nums.size();
	if(n == 0){
    
		return 0;
	}else if(n == 1){
    
		return nums[0];
	}
	vector<int> dp(n);
	dp[0] = nums[0];
	int res = nums[0];
	for(int i = 1; i < n; i++){
    
		dp[i] = max(dp[i-1] + nums[i], nums[i]);
		res = max(res, dp[i]);
	}
	return res;
}

int main(){
    
	int n, res;
	cin>>n;
	vector<int> nums(n);
	for(int i = 0; i < n; i++){
    
		cin>>nums[i];
	}
	res = maxSubArray(nums);
	cout<<res;
	return 0;
}