// Vivek Rai
// Blazer_007

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/detail/standard_policies.hpp>

#define fastio 		ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define mp	     	make_pair
#define inf         0x3f3f3f3f
//#define INF         0x3f3f3f3f3f3f3f3fLL
#define ll          long long
#define pb          push_back
#define pii         pair<ll,ll>
#define vi          vector<ll>
#define vii         vector<pii>
#define mi          map<ll,ll>
#define mii         map<pii,ll>
#define ppi	    	pair<ll,pii>
#define all(a)      (a).begin(),(a).end()
#define FF           first
#define SS           second
#define sz(x)       (int)x.size()
#define endl        '\n'
#define hell        1000000007
#define see(x)	    cout<<x<<endl;
#define see2(x,y)   cout<<x<<" "<<y<<endl;
#define see3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl;
#define bit(x, y)   (((x)>>(y))&1)
#define bpt(x)      (__builtin_popcount(x))
#define bptl(x)     (__builtin_popcountll(x))
#define loop(i,a,b)  for(int i=a;i<b;i++)
#define rloop(i,a,b) for(int i=a;i>=b;i--)
#define N 2000010

using namespace std;
//using namespace __gnu_pbds;

//typedef priority_queue<int> maxHeap;
//typedef priority_queue<int,vector<int>,greater<int>()) minHeap;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// find_by_order(index) -> value at given index or Kth smallest element in set
// order_of_key(X) -> number of elements strictly less than X
//typedef tree<pii , null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> OST;

#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template <typename Arg1>
    void __f(const char* name, Arg1&& arg1){
        cout << name << " : " << arg1 << endl;
        //use cerr if u want to display at the bottom
    }
    template <typename Arg1, typename... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args){
        const char* comma = strchr(names + 1, ','); cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
    }
#else
#define trace(...)
#endif


struct line
{
    ll slope;
    ll intercept;
    line(ll m, ll k)
    {
        slope = m;
        intercept = k;
    }
    ll valAtX0(ll x0)
    {
        return slope*x0 + intercept;
    }
    ll x_intersect(line& l2)
    {
        return ceil(1.0*(l2.intercept - intercept)/(slope - l2.slope));
    }
};
 
class CHT
{
    deque<pair<line,ll>> dq;
    public:
        void insert(line l)
        {
            if(dq.empty())
            {
                dq.push_back({l, 0});
                return;
            }
            while(!dq.empty())
            {
                ll x0 = l.x_intersect(dq.back().first);
                if(x0 <= dq.back().second)
                    dq.pop_back();
                else break;
            }
            ll x0 = l.x_intersect(dq.back().first);
            dq.push_back({l, x0});
        }
 
        ll query(ll x0)
        {
            while(dq.size() > 1)
            {
                if(dq[1].second <= x0)
                    dq.pop_front();
                else break;
            }
            return dq[0].first.valAtX0(x0);
        }
};

ll solve(vi& v, ll n, ll c){
    vi dp(n);
    CHT minimaDS;
    dp[0] = 0; 
    minimaDS.insert({-2*v[0], v[0]*v[0]});
 
    for(int i = 1; i < n; i++)
    {
        dp[i] = v[i]*v[i] + c + minimaDS.query(v[i]);
        minimaDS.insert({-2*v[i], dp[i] + v[i]*v[i]});
    }
 
    return dp[n-1];
}

void solution(){
	ll n , c;
    cin >> n >> c;
    vi v(n);
    loop(i,0,n)
        cin >> v[i] ;
    cout << solve(v, n, c) << endl;
}

signed main(){
    fastio

    ll t=1;
    // cin>>t;
    loop(i,1,t+1){
    	//cout<<"Case #"<<i<<": ";
    	solution();
    }
}




Measured memory_bytes: 6656