文章目录
一、题目大意:
二、解题思路:
(1): 所求的两个子序列必定以一个数为分割点。
(2): 左边的子序列必定以分割点或者左边的其中一个数为结尾,右边的子序列必定以分割点右边的其中一个数为起始。
- 定义状态:
- q i a n [ i ] qian[i] qian[i]: 以 a [ i ] a[i] a[i]为结尾的最大连续子序列和。
- h o u [ i ] hou[i] hou[i]: 以 a [ i ] a[i] a[i]为起始的最大连续子序列和。
- t o t a l 1 [ i ] total1[i] total1[i]: [ 0 , i ] [0,i] [0,i]区间内的最大连续子序列和。
- t o t a l 2 [ i ] total2[i] total2[i]: [ i , n − 1 ] [i,n-1] [i,n−1]区间内的最大连续子序列和。
- 目标状态: m a x ( { t o t a l 1 [ i ] + t o t a l 2 [ i + 1 ] ∣ 0 < = i < n } ) max(\{total1[i]+total2[i+1]\quad | \quad 0<=i<n\}) max({total1[i]+total2[i+1]∣0<=i<n})
- 状态转移:
- q i a n [ i ] = m a x ( a [ i ] , q i a n [ i − 1 ] + a [ i ] ) qian[i] = max(a[i],qian[i-1]+a[i]) qian[i]=max(a[i],qian[i−1]+a[i])
- h o u [ i ] = m a x ( a [ i ] , h o u [ i + 1 ] + a [ i ] ) hou[i] = max(a[i], hou[i+1]+a[i]) hou[i]=max(a[i],hou[i+1]+a[i])
- t o t a l 1 [ i ] = m a x ( { q i a n [ k ] ∣ 0 < = k < = i } ) total1[i] = max(\{qian[k]\quad|\quad 0<=k<=i\}) total1[i]=max({qian[k]∣0<=k<=i})
- t o t a l 2 [ i ] = m a x ( { h o u [ k ] ∣ i < = k < = n − 1 } ) total2[i] = max(\{hou[k]\quad|\quad i<=k<=n-1\}) total2[i]=max({hou[k]∣i<=k<=n−1})
- 初始状态:
- q i a n [ 0 ] = a [ 0 ] qian[0] = a[0] qian[0]=a[0],
- h o u [ n − 1 ] = a [ n − 1 ] hou[n-1] = a[n-1] hou[n−1]=a[n−1]
- 复杂度: O ( n ) O(n) O(n)
三、代码:
#include<iostream>
using namespace std;
const int MAX = 50000+5;
const int inf = 1 << 29;
int T;
int main()
{
int qian[MAX], hou[MAX], total1[MAX], total2[MAX];
int a[MAX];
cin >> T;
for(int i=0; i<T; i++)
{
int n;
cin >> n;
for(int j=0; j<n; j++)
cin >> a[j];
qian[0] = a[0];
for(int j=1; j<n; j++)
qian[j] = max(a[j], qian[j-1]+a[j]);
hou[n-1] = a[n-1];
for(int j=n-2; j>=0; j--)
hou[j] = max(a[j], hou[j+1]+a[j]);
total1[0] = qian[0];
for(int j=1; j<n; j++)
total1[j] = max(total1[j-1], qian[j]);
total2[n-1] = hou[n-1];
for(int j=n-2; j>=0; j--)
total2[j] = max(total2[j+1], hou[j]);
int ans = -inf;
for(int j=0; j<n-1; j++)
ans = max(ans, total1[j]+total2[j+1]);
cout << ans << endl;
}
return 0;
}