POJ 2479 两段最大子序列

/*
    题意: 在s串种,求连续的整数和的串s1和s2，s1与s2不相交，使得s1+s2最大
    思路: 正向dp和反向rev_dp,代表由某一点到i的最大和 dp[i] = max(dp[i- 1] + a[i]
          正向sum 和 反向rev_sum,代表i点之前(之后)最大的连续字段和
          枚举1~n点
*/
dp[1] = a[1];
rev_dp[n] = a[n];
for (int i = 2; i <= n; ++i)
{
    dp[i] = max(dp[i - 1] + a[i], a[i]);
}
for (int i = n - 1; i > 0; --i)
{
    rev_dp[i] = max(rev_dp[i + 1] + a[i], a[i]);
}
int ans = INF;

max_rev_dp[n] = rev_dp[n];
for(int j = n - 1; j > 0; --j)
{
    max_rev_dp[j] = max(rev_dp[j], max_rev_dp[j + 1]);
}

for (int i = 2; i <= n; ++i)
{
    ans = max(dp[i - 1] + max_rev_dp[i], ans);
}
cout << ans << endl;