#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;

/*BigInteger
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace xxx = boost::multiprecision;
using Bint = xxx::cpp_int;
using Real = xxx::number<xxx::cpp_dec_float<1024>>;
*/

#define int long long
#define pb(x) push_back(x)
#define m0(x) memset((x), 0LL, sizeof(x))
#define mm(x) memset((x), -1LL, sizeof(x))

//container
#define ALL(x) (x).begin(), (x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EACH(i, c) for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define UNIQUE(v) (v).erase(unique((v).begin(), (v).end()), (v).end());
#define PERM(c) \
  sort(ALL(c)); \
  for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))

// debug
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;

// bit_macro
#define Bit(n) (1LL << (n))
#define Bitset(a, b) (a) |= (1LL << (b))
#define Bitunset(a, b) (a) &= ~(1LL << (b))
#define Bitcheck(a, b) ((((a) >> (b)) & 1LL) == 1LL)
#define Bitcount(a) __builtin_popcountll((a))

//typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;

//constant
constexpr int INF = (int)1e18;
constexpr int MOD = (int)1e9 + 7;
constexpr double PI = (double)acos(-1);
constexpr double EPS = (double)1e-10;
constexpr int dx[] = {-1, 0, 0, 1, 0, -1, -1, 1, 1};
constexpr int dy[] = {0, -1, 1, 0, 0, 1, -1, 1, -1};

//
template <typename T>
void chmax(T &a, T b) { a = max(a, b); }
template <typename T>
void chmin(T &a, T b) { a = min(a, b); }
//
inline int toInt(string s) {
  int v;
  istringstream sin(s);
  sin >> v;
  return v;
}
template <class T>
inline string toString(T x) {
  ostringstream sout;
  sout << x;
  return sout.str();
}

//
struct Accelerate_Cin {
  Accelerate_Cin() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(20);
  };
};

//O((N+Q)log N)
//直線集合おける最小値（最大値）を求める。

struct CHT {
  vector<P> deq; // y = first * x + second
  int s, t;
  CHT(int n) { //n:クエリ数
    deq.resize(n);
    s = 0, t = 0;
  }

  void add(int a, int b) { //a:単調減少(単調増加)
    const P p(a, b);
    while (s + 1 < t && check(deq[t - 2], deq[t - 1], p)) t--;
    deq[t++] = p;
  }

  int incl_query(int x) { //x：単調増加
    while (s + 1 < t && f(deq[s], x) >= f(deq[s + 1], x)) s++;
    return f(deq[s], x);
  }
  int query(int x) { //条件なし
    int ng = s - 1, ok = t - 1;
    while (abs(ok - ng) > 1) {
      int mid = (ok + ng) / 2;
      if (isright(deq[mid], deq[mid + 1], x)) {
        ng = mid;
      } else {
        ok = mid;
      }
    }
    return f(deq[ok], x);
  }

private:
  bool isright(const P &p1, const P &p2, int x) {
    return (p1.second - p2.second) >= x * (p2.first - p1.first);
  }
  bool check(const P &p1, const P &p2, const P &p3) {
    return (p2.first - p1.first) * (p3.second - p2.second) >= (p2.second - p1.second) * (p3.first - p2.first);
  }
  int f(const P &p, int x) {
    return p.first * x + p.second;
  }
};

signed main() {
  int N, C;
  cin >> N >> C;
  vec h(N);
  for (int i = 0; i < N; i++) cin >> h[i];

  CHT cht(N);
  static int dp[202020];
  dp[0] = 0;
  cht.add(-2 * h[0], h[0] * h[0] + dp[0]);

  for (int i = 1; i < N; i++) {
    dp[i] = cht.query(h[i]) + h[i] * h[i] + C;
    cht.add(-2 * h[i], h[i] * h[i] + dp[i]);
  }

  cout << dp[N - 1] << endl;
  return 0;
}


Measured memory_bytes: 6528