题目描述: 给出一个长度为 n 的序列 a,选出其中连续且非空的一段使得这段和最大。
参考题目:洛谷上的最大子段和 (洛谷上的题需要考虑负数的情况)
- 1.纯模拟:复杂度为 O ( n 3 ) O(n^3) O(n3)
#include<bits/stdc++.h>
using namespace std;
#define MAXX 200005
int n, a[MAXX], ans;
int main(){
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
ans = -0x3fffffff;
for(int i = 1; i <= n; i++)
for(int j = i; j <= n; j++){
int tmp = 0;
for(int k = i; k <= j; k++) tmp += a[k];
ans = max(tmp, ans);
}
cout << ans;
return 0;
}
- 2.前缀和:复杂度为 O ( n 2 ) O(n^2) O(n2)
#include<bits/stdc++.h>
using namespace std;
#define MAXX 200005
int n, a[MAXX], sum[MAXX], ans;
int main(){
cin >> n;
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
ans = -0x3fffffff;
for(int i = 1; i <= n; i++)
for(int j = i; j <= n; j++)
ans = max(ans, sum[j] - sum[i - 1]);
cout << ans;
return 0;
}
- 3.前缀和优化:复杂度为 O ( n ) O(n) O(n)
#include<bits/stdc++.h>
using namespace std;
#define MAXX 200005
int n, a[MAXX], ans, sum[MAXX], minn;
int main(){
cin >> n;
for(int i = 1; i <= n; i++){
scanf("%d", &a[i]);
sum[i] = sum[i - 1] + a[i];
}
minn = sum[0], ans = -0x3fffffff;
for(int i = 1; i <= n; i++){
ans = max(ans, sum[i] - minn);
minn = min(minn, sum[i]);
}
cout << ans;
return 0;
}
- 4.分治:复杂度为 O ( n l o g n ) O(nlogn) O(nlogn)
#include<bits/stdc++.h>
using namespace std;
#define MAXX 200005
#define ll long long
int n, a[MAXX], sum[MAXX];
int maxn(int l, int r){
int sum = 0, mid = (l + r) / 2;
if(l == r) return max(a[l], 0);
int ltmp = 0, lsum = 0;
for(int i = mid; i >= l; i--){ //注意要从分断点向两边计算
ltmp += a[i];
lsum = max(ltmp, lsum);
}
int rtmp = 0, rsum = 0;
for(int i = mid; i <= r; i++){
rtmp += a[i];
rsum = max(rtmp, rsum);
}
//比较左边,右边,和两边都有这三种情况
sum = max(lsum + rsum, maxn(mid + 1, r));
sum = max(lsum + rsum, maxn(l, mid));
return sum;
}
int main(){
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
cout << maxn(1, n);
return 0;
}
- 5.动态规划(和方法3类似):复杂度为 O ( n ) O(n) O(n)
#include<bits/stdc++.h>
using namespace std;
#define MAXX 200005
int n, a[MAXX], ans, tmp = 0; //tmp表示前i个数的最大子段和
int main(){
cin >> n;
for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
ans = -0x3fffffff;
for(int i = 1; i <= n; i++){ //tmp[i] = max(tmp[i - 1] + a[i], a[i])
tmp > 0 ? tmp += a[i] : tmp = a[i];
ans = max(ans, tmp);
}
cout << ans;
return 0;
}