[最大子序列和]Hdu 5280 Senior's Array

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
typedef long long ll;
using namespace std;

const int MAXN=1000+5;
const int INF=0x3f3f3f3f;

int t;
ll n,p,a[MAXN];

ll solve () {
    ll tmax = -INF, sum = 0;
    for (int i = 0; i < n; i++) {
        if (sum < 0) sum = a[i];
        else sum += a[i];
        tmax = max (tmax, sum);
    }
    return tmax;
}

int main(){
	
	scanf("%d",&t);

	while(t--){
		ll ans=-INF;
		cin>>n>>p;
		for(int i=0;i<n;++i)
			cin>>a[i];
		for(int i=0;i<n;++i){
			int t=a[i];
			a[i]=p;
			ans=max(ans,solve());
			a[i]=t;
		}
		cout<<ans<<endl;
	}
}