解题思路:
(1)动态规划
class Solution {
public:
int maxsumofSubarray(vector<int>& arr) {
int maxsum=0,maxsofar=0;
for(int i=0;i<arr.size();i++) {
if(maxsofar+arr[i]>=arr[i]) {
maxsofar+=arr[i];
} else maxsofar=arr[i];
if(maxsum<maxsofar) maxsum=maxsofar;
}
return maxsum;
}
};