#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i,N) for(int i = 0; i < (N); i++)
#define repr(i,N) for(int i = (N) - 1; i >= 0; i--)
#define rep1(i,N) for(int i = 1; i <= (N) ; i++)
#define repr1(i,N) for(int i = (N) ; i > 0 ; i--)
#define each(x,v) for(auto& x : v)
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define vrep(v,it) for(auto it = v.begin(); it != v.end(); it++)
#define vrepr(v,it) for(auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) int __VA_ARGS__; in(__VA_ARGS__)
#define inl(...) ll __VA_ARGS__; in(__VA_ARGS__)
#define ins(...) string __VA_ARGS__; in(__VA_ARGS__)
using namespace std; void solve();
using ll = long long; using vl = vector<ll>;
using vi = vector<int>; using vvi = vector< vector<int> >;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {IoSetupNya() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7);} } iosetupnya;
template<typename T, typename U> inline bool amin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template<typename T, typename U> inline bool amax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T, typename U> ostream& operator <<(ostream& os, const pair<T, U> &p) { os << p.first << " " << p.second; return os; }
template<typename T, typename U> istream& operator >>(istream& is, pair<T, U> &p) { is >> p.first >> p.second; return is; }
template<typename T> ostream& operator <<(ostream& os, const vector<T> &v) { int s = (int)v.size(); rep(i,s) os << (i ? " " : "") << v[i]; return os; }
template<typename T> istream& operator >>(istream& is, vector<T> &v) { for(auto &x : v) is >> x; return is; }
void in(){} template <typename T,class... U> void in(T &t,U &...u){ cin >> t; in(u...);}
void out(){cout << "\n";} template <typename T,class... U> void out(const T &t,const U &...u){ cout << t; if(sizeof...(u)) cout << " "; out(u...);}
template<typename T>void die(T x){out(x); exit(0);}
#ifdef NyaanDebug
  #include "NyaanDebug.h"
  #define trc(...) do { cerr << #__VA_ARGS__ << " = "; dbg_out(__VA_ARGS__);} while(0)
  #define trca(v,N) do { cerr << #v << " = "; array_out(v , N);cout << endl;} while(0)
#else
  #define trc(...)
  #define trca(...)
  int main(){solve();}
#endif
using P = pair<int,int>; using vp = vector<P>;
constexpr int MOD = /** 1000000007; //*/ 998244353;
////////////////

template<typename T, T INF>
struct LiChaoTree{

  struct Line{
    T slope , intercept;
    Line(T slope,T intercept) : slope(slope),intercept(intercept){}
    inline T get(T x) const{
      return slope * x + intercept;
    }
    inline bool over(const Line& other , const T &x) const{
      return get(x) < other.get(x);
    }
  };

  // remind セグ木は0-indexedの実装
  vector<T> xset;
  vector<Line> seg;
  int _size;

  // 引数xにはx座標の集合を入れる
  LiChaoTree(const vector<T> &x) : xset(x) {
    sort( xset.begin() , xset.end() );
    xset.erase( unique(xset.begin() , xset.end() ) , xset.end() );
    _size = 1; while( _size < (int)xset.size() ) _size <<= 1;
    while( (int)xset.size() < _size ) xset.push_back(xset.back() + 1);
    seg.assign( 2 * _size , Line(0, INF) );
  }

  // 以上 xset[max]以下であることを仮定
  int get_more_idx(T k){ 
    return lower_bound( xset.begin() , xset.end() , k ) - xset.begin();
  }
  // 以下 xset[0]以上であることを仮定
  int get_less_idx(T k){
    int ret = upper_bound( xset.begin() , xset.end() , k ) - xset.begin();
    return max(0 , ret - 1);
  }

  // 内部用
  void inner_update(T a, T b, int left, int right, int seg_idx){
    Line line(a , b);
    while(1){
      int mid = (left + right) >> 1;
      bool l_over = line.over(seg[seg_idx], xset[left] );
      bool r_over = line.over(seg[seg_idx], xset[right-1] );
      if(l_over == r_over){
        if(l_over) swap(seg[seg_idx] , line);
        return;
      }
      bool m_over = line.over(seg[seg_idx], xset[mid] );
      if(m_over) swap(seg[seg_idx], line);
      if(l_over != m_over) seg_idx = (seg_idx << 1) , right = mid;
      else seg_idx = (seg_idx<<1) | 1 , left = mid;
    }
  }

  // 内部用
  void inner_update(T a, T b, int seg_idx){ 
    int left , right;
    int upper_bit =  31 - __builtin_clz(seg_idx);
    left = (_size >> upper_bit) * (seg_idx - (1 << upper_bit) );
    right = left + (_size >> upper_bit);
    inner_update(a , b , left , right , seg_idx);
  }
  
  // y = ax + bなる直線を追加
  void update(T a, T b){
    inner_update(a , b , 0 , _size , 1);
  }

  // 閉区間x in [left , right]に線分y = ax + bを追加するクエリ
  void update_line_segment(T a,T b,T low,T high){
    int left = get_more_idx(low) + _size;
    int right= get_less_idx(high)+ _size + 1;
    for( ; left < right; left >>= 1 , right >>= 1){
      if(left & 1) inner_update(a , b , left++);
      if(right& 1) inner_update(a , b , --right); 
    }
  }

  T inner_query(int x , int segidx){
    T ret = seg[segidx].get(x);
    while(segidx > 1){
      segidx = segidx >> 1;
      ret = min(ret , seg[segidx].get(x) );
    }
    return ret;
  }

  // x = xset[k]なる点における最小値クエリ
  T query_idx(int k) {
    const T x = xset[k];
    k += _size;
    return inner_query(x , k);
  }

  // xにおける最小クエリ
  T query(T x){ return query_idx( get_more_idx(x) ); }
  
};

void solve(){
  inl(N , C);
  vl h(N); in(h);
  vl dp(N , 0);
  vl xs(1000001); iota(all(xs) , 0);
  LiChaoTree<ll , infLL> lichao( xs );
  lichao.update(h[0] * (-2) , dp[0] + h[0] * h[0]);
  rep1(i , N - 1){
    dp[i] = lichao.query(h[i]) + h[i] * h[i] + C;
    lichao.update(h[i] * (-2) , dp[i] + h[i] * h[i]);
  }
  out(dp[N - 1]);
  
}


Measured memory_bytes: 54136