wspl09876送分题

#include<cstdio>
#include<iostream>
using namespace std;
int a[99999];
int s;int n,p; 
int main(){
	freopen("songfen.in","r",stdin);
	 freopen("songfen.out","w",stdout);
	scanf("%d%d",&n,&p);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	int maxn=-9999999;
	for(int i=1;i<=n;i++) 
	{
		s=0;
		for(int j=1;j<=n;j++)
		{
			
			s=s+(j!=i?a[j]:p);
			maxn=max(s,maxn);
			if(s<0)s=0;
		}
		
	}
	printf("%d",maxn);
	
	fclose(stdin);
	fclose(stdout);
}