#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<class T> using vv=vector<vector<T>>;
template<class T> ostream& operator<<(ostream &os, const deque<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"{"; rep(i,t.size()) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class T,size_t n> ostream& operator<<(ostream &os, const array<T,n> &t) {
	os<<"{"; rep(i,n) {os<<t[i]<<",";} os<<"}"<<endl; return os;}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T,class U> ostream& operator<<(ostream &os, const tuple<S,T,U> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<")";}
template<class S, class T,class U,class V> ostream& operator<<(ostream &os, const tuple<S,T,U,V> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<")";}
template<class S, class T,class U,class V,class W> ostream& operator<<(ostream &os, const tuple<S,T,U,V,W> &t) { return os<<"("<<get<0>(t)<<","<<get<1>(t)<<","<<get<2>(t)<<","<<get<3>(t)<<","<<get<4>(t)<<")";}
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#define out(args...){vector<string> a_r_g_s=s_p_l_i_t(#args, ','); e_r_r(a_r_g_s.begin(), args); }
vector<string> s_p_l_i_t(const string &s, char c){vector<string> v;int d=0,f=0;string t;for(char c:s){if(!d&&c==',')v.pb(t),t="";else t+=c;if(c=='\"'||c=='\'')f^=1;if(!f&&c=='(')++d;if(!f&&c==')')--d;}v.pb(t);return move(v);}
void e_r_r(vector<string>::iterator it) {}
template<typename T, typename... Args> void e_r_r(vector<string>::iterator it, T a, Args... args){ if(*it==" 1"||*it=="1") cerr<<endl; else cerr << it -> substr((*it)[0] == ' ', it -> length()) << " = " << a << ", "; e_r_r(++it, args...);}
#else
#define out
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7;

typedef pair<ll,ll> pdd;
struct CHT{
  deque<pdd> que; //p.X:decreasing, p.X * x + p.Y
  inline ll eval(const pdd &p,const ll &x){
    return p.X*x+p.Y;
  }
  ll minv(ll x){
    int n=que.size();
    if(n==1 || eval(que[n-2],x)>=eval(que[n-1],x)) return eval(que[n-1],x);
    int l=-1,r=n-2,m;
    while(r-l>1){
      m=(l+r)/2;
      if(eval(que[m],x)<eval(que[m+1],x)) r=m;
      else l=m;
    }
    return eval(que[r],x);
  }
  ll min(ll x){ //各クエリでxは非減少
    while(que.size()>1 && eval(que[0],x)>eval(que[1],x)) que.pop_front();
    return eval(que[0],x);
  }
  inline bool pop(const pdd &a,const pdd&b, const pdd &c){
    return (b.X-a.X)*(c.Y-b.Y)>=(b.Y-a.Y)*(c.X-b.X);
  }
  void pb(pdd p){
    while(que.size()>1 && pop(que[que.size()-2],que.back(),p)) que.pop_back();
    que.pb(p);
  }
  void pf(pdd p){
    while(que.size()>1 && pop(que[0],que[1],p)) que.pop_front();
    que.push_front(p);
  }
};

int main(){
  ios_base::sync_with_stdio(false);
  cout<<fixed<<setprecision(0);
	ll n,c;
	cin>>n>>c;
	vector<ll> hs(n);
	rep(i,n) cin>>hs[i];
	vector<ll> sq(n);
	rep(i,n) sq[i]=hs[i]*hs[i];
	CHT cht;
	vector<ll> dp(n);
	rep(i,n){
		ll v=0;
		if(i){
			v+=cht.min(hs[i]);
			v+=sq[i]+c;
		}
		dp[i]=v;
		cht.pb(pdd(-2*hs[i],dp[i]+sq[i]));
	}
	out(dp,1);
	cout<<dp[n-1]<<endl;
  return 0;
}


Measured memory_bytes: 7168