#include<iostream>
#include<assert.h>
using namespace std;
int maxSum(int* a, int n)
{
assert(a != NULL && n >= 1);
int maxSum = a[0];
int currentSum = a[0];
for...
#include <iostream>#include <cstdio>using namespace std;// 最大子数组int findDp(int a[], int n){ if(n==0){ return 0; } int max = a[0], sum = 0, ind = -1; for (int i = 0;...
