codeforces Manthan, Codefest 17 B Marvolo Gaunt's Ring(dp)

碰到能套模板的dp还能套，不能套的基本就死了。这么个水题想了一个多小时猜想到解法。交了没多久就被hack了。又调了半个多小时才发现写错变量类型了。
思路：比较基础的dp，对于p,q,r三个数，单独分开操作的。先是计算p和那n个数的乘积，dp[i]保存的是max(num[1…i] * p)。然后再对q操作，这时dp[i]保存的是max(dp[i-1] ,dp[i] + q * num[i])。对r的操作同q。

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
const int MAXN = 1e5+10;
const LL INF = 8e18;
LL num[MAXN];
LL dp[MAXN];

int main()
{
    ios::sync_with_stdio(false);
    LL maxn = - INF;
    int n;
    LL p,q,r;
    dp[0] = - INF;
    LL now,res = -INF;
    cin >> n >> p >> q >> r;
    for(int i = 1; i <= n; ++i)
        cin >> num[i];

    for(int i = 1; i <= n; ++i)
    {
        now = p*num[i];
        dp[i] = max(dp[i-1],now);
    }

    for(int i = 1; i <= n; ++i)
    {
        now = q*num[i];
        dp[i] = max(dp[i-1],dp[i]+now);
    }

    for(int i = 1; i <= n; ++i)
    {
        now = r*num[i];
        dp[i] = max(dp[i-1],dp[i]+now);
        res = max(res,dp[i]);
    }
    cout << res << endl;
    return 0;
}