C++之间最长连续公共子串的长度(最长子数组和)!
#include <iostream>
using namespace std;
int lss(int arr[], int n){
int sum = 0, before = 0;
for (int i = 0; i < n; i++){
sum += arr[i];
if (sum>before) before = sum;
else if (sum < 0) sum = 0;
}
return before;
}
int main(){
int arr[] = { -1, -2, 3, 4, -2, 7, 8, -1 };
int sum = lss(arr, sizeof(arr) / sizeof(arr[0]));
cout << sum << endl;
return 0;
}