【Codeforces 1155D】 Beautiful Array

CF1155D
题意 给你n个数字的数组 然后还有一个 x
你可以选择一段区间乘上 x
输出最大子段和
这道题做的时候一直在往贪心想
真的是脑子太笨了
实验室其他大佬都是拿dp过的
本着笨鸟先飞的思想赶紧学了过来
dp[300025][3]
其中第二维代表了三个状态 0 就是不操作乘法
1 操作乘法
2 操作乘法结束以后
然后我们只要不断取 ans = max(dp[i][0],max(dp[i][1],dp[i][2]))
然后输出答案即可

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 300025;
ll dp[MAX_N][3],arr[MAX_N];

int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    int n;ll x;scanf("%d%lld",&n,&x);
    for(int i = 1;i<=n;++i) scanf("%lld",&arr[i]);
    ll ans = 0;
    for(int i = 1;i<=n;++i)
    {
        dp[i][0] = max(dp[i-1][0]+1ll*arr[i],arr[i]);
        dp[i][1] = max(max(dp[i-1][1],dp[i-1][0])+1ll*arr[i]*x,1ll*x*arr[i]);
        dp[i][2] = max(max(dp[i-1][2],dp[i-1][1])+arr[i],arr[i]);
        ans = max(ans,dp[i][0]);
        ans = max(ans,dp[i][1]);
        ans = max(ans,dp[i][2]);
    }
    printf("%lld\n",ans);
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}