请求加强数据

#include <iostream>
#include <cstdio>
#define ri register int

signed main(void){
	freopen("qwq.in","w",stdout);
	int n=5e4,L=1e7;
	printf("%d %d\n%d ",n,L,L);
	for(ri i=2;i<=n;i++)printf("1 "); 
	return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#define ri register int
#define int long long

inline int read() {
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
	return x*f;
}

const int N=5e4+5;
int dp[N],a[N],sum[N],n,l,p=0;

signed main(void){
	std::memset(dp,0x3f,sizeof(dp));
	n=read(),l=read(),dp[0]=0;
	for(ri i=1;i<=n;i++)a[i]=read(),sum[i]=a[i];
	for(ri i=1;i<=n;i++)sum[i]+=sum[i-1];
	for(ri i=1;i<=n;i++){
		for(ri j=p;j<i;j++){
			if(dp[j]+(sum[i]-sum[j]+i-j-1-l)*(sum[i]-sum[j]+i-j-1-l)<=dp[i]){
				dp[i]=std::min(dp[i],dp[j]+(sum[i]-sum[j]+i-j-1-l)*(sum[i]-sum[j]+i-j-1-l));
				p=j;
			}
		}
	}
	printf("%lld",dp[n]);
	return 0;
}