#include<stdio.h>
#include
#include
using namespace std;
class MaxArray {
public:
MaxArray() {
int size = 0;
cin >> size;
vector v1;
v1.resize(size);
for (int i = 0; i < size; i++) {
cin >> v1[i];
}
int num = v1[0];
int max = num;
for (int i = 0; i < size; i++) {
num = v1[i];
for (int j = i + 1; j < size; j++) {
num += v1[j];
if (num >= max) {
max = num;
}
}
}
cout << max;
}
};
int main() {
MaxArray a1;
return 0;
}
C++求一个数组中所有的子数组元素和的最大值
最新推荐文章于 2022-03-03 21:48:28 发布