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

const LL INF = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 5005;

template<typename _T>
_T MIN( const _T a, const _T b )
{
	return a < b ? a : b;
} 

int N,tp;
LL f[MAXN][MAXN];
LL s[MAXN];

int main(){
	freopen("2019partition.in","r",stdin); 	
	freopen("2019partition.out","w",stdout);
	cin>>N>>tp;
	for(int i=1;i<=N;i++){
		scanf("%lld",&s[i]);
		s[i]+=s[i-1];
	}
	for(int i=1;i<=N;i++)f[1][i]=s[i]*s[i];
	for(int i=2;i<=N;i++)
		for(int j=1;j<=N;j++)
			f[i][j]=INF;
	LL mn; 
	int l;
	for(int i=2;i<=N;i++){
		mn=INF,l=i;
		for(int j=i;j<=N;j++){
			while(l&&s[i-1]-s[l-1]<=s[j]-s[i-1]){
				mn=MIN(mn,f[l][i-1]);
				l--;
			}
			f[i][j]=mn+(s[j]-s[i-1])*(s[j]-s[i-1]);
		}
	}
	LL res=INF;
	for(int i=1;i<=N;i++)res=MIN(res,f[i][N]);
	printf("%lld",res);
	return 0;
}