#include <stdio.h>
int maxSubSum(int arr[],size_t n){
int sum = arr[0]; //记录最大子串和
int currSum = 0; //当前累加和
int i;
for(i=0;i<n;++i){
currSum += arr[i];
if(currSum > sum){
sum = currSum;
}
if(currSum < 0){
currSum = 0;
}
}
return sum;
}
int main(){
return 0;
}