51Nod 1049 最大子段和

题意

求给定长度为n的序列的最大字段和。

题解

[线性DP--字段和模型]
状态定义：
    dp[i]: 以a[i]为结尾的字段和
属性：
    Max
集合划分：
考虑当前a[i]的两种决策:
    1. 自己自成一段 , dp[i] = a[i]
    2. 和前面一起共成一段, dp[i] = dp[i-1] + a[i]
故而：
    dp[i] = max(dp[i-1], a[i])
起始状态：
    dp[0] = -INF
目标状态：
    ans = max(dp[i]) [1<=i<=n]

Code

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
#define read(a) scanf("%d", &a)
#define readl(a) scanf("%lld", &a)
#define readf(a) scanf("%lf", &a)
#define readc(a) scanf("%c", &a)
#define reads(a) scanf("%s", a)
#define Buff ios::sync_with_stdio(false)
#define mem(a) memset(a, 0, sizeof a)
#define pb push_back
const ll INF = 1e16 + 7;
const int N = 1e5 + 7;
const int M = 1e6 + 7;
const ll mod = 1e9 + 7;
ll dp[N], a[N];
signed main()
{
    Buff;
    int n;
    while(cin >> n)
    {
        for(int i = 1; i <= n; i++) cin >> a[i];
        dp[0] = -INF;
        ll ans = -INF;
        for(int i = 1; i <= n; i++)
        {
            dp[i] = max(dp[i-1] + a[i], a[i]);
            ans = max(dp[i], ans);
        }
        cout << max(0ll, ans) << "\n";
    }
    return 0;
}