#include <iostream>
#include <iosfwd>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cassert>
#include <cctype>
#include <climits>
#include <vector>
#include <bitset>
#include <set>
#include <queue>
#include <stack>
#include <map>
#include <deque>
#include <string>
#include <list>
#include <iterator>
#include <sstream>
#include <complex>
#include <fstream>
#include <functional>
#include <numeric>
#include <utility>
#include <algorithm>
#include <chrono>
#include <unordered_set>
#include <unordered_map>
#include <random>
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 

using namespace __gnu_pbds;
using namespace std;

template<class T> using OrderedSet = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// MACROS_BEGIN
#define CLEAR() cerr << endl;
#define LET(x, a) __typeof(a) x = a
#define FOREACH(it, v) for (LET(it, (v).begin()); it != (v).end(); ++it)
#define REPEAT(i, n) for (int i = 0; i < (n); ++i)
// MACROS_END

// GENERIC_UTILITIES_BEGIN
// template <class T> inline int size(const T& c) {return (int) c.size();}
inline long long two(int x) {return (1LL << (x));}

vector<string> split(string s, string delim) {
    s += delim[0];
    string tmp;
    vector<string> result;
    for (int i = 0; i < size(s); ++i) {
        if (delim.find(s[i]) == string::npos) {
            tmp.push_back(s[i]);
        }
        else {
            if (tmp != "") result.push_back(tmp);
            tmp.clear();
        }
    }
    return result;
}
// GENERIC_UTILITIES_END

// FAST_IO_BEGIN
// FAST_IO_END

// STANDARD_IO_BEGIN
#ifndef USING_FAST_IO
int readInt() {int N = -1; scanf("%d", &N); return N;}
double readDouble() {double D; scanf("%lf", &D); return D;}
string readString() {char buffer[1 << 20]; scanf("%s", buffer); return buffer;}
long long readLongLong() {long long N = -1; scanf("%lld", &N); return N;}
#endif // NOT DEFINED USING_FAST_IO
// STANDARD_IO_END


// OUTPUT_UTILITIES_BEGIN
template <class A, class B> ostream& operator << (ostream& o, const pair<A, B>& p);
template <class T> ostream& operator << (ostream& o, const vector<T>& v);
template <class A, class B> ostream& operator << (ostream& o, const map<A, B>& m);
template <class T> ostream& operator << (ostream& o, const set<T>& s);
template <class T> ostream& operator << (ostream& o, const queue<T>& q);
template <class T> ostream& operator << (ostream& o, const stack<T>& s);

template <class A, class B> ostream& operator << (ostream& o, const pair<A, B>& p) {
    o << "(" << p.first << "," << p.second << ")"; return o;
}

template <class T> ostream& operator << (ostream& o, const vector<T>& v) {
    o << "{"; bool first = true; FOREACH(it, v) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class A, class B> ostream& operator << (ostream& o, const map<A, B>& m) {
    o << "{"; bool first = true; FOREACH(it, m) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const set<T>& s) {
    o << "{"; bool first = true; FOREACH(it, s) { if (!first) o << ","; first = false; o << *it; } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const queue<T>& q) {
    o << "{"; bool first = true; queue<T> p = q; while (!p.empty()) { if (!first) o << ","; first = false; o << p.front(); p.pop(); } return o << "}";
}

template <class T> ostream& operator << (ostream& o, const stack<T>& s) {
    o << "{"; bool first = true; stack<T> r = s; while (!r.empty()) { if (!first) o << ","; first = false; o << r.top(); r.pop(); } return o << "}";
}
// OUTPUT_UTILITIES_END

// DEBUGGING_UTILITIES_BEGIN
// DEBUGGING SWITCH
#define PHOENIX_DEBUG

#ifdef PHOENIX_DEBUG
#define DEBUG(...) __f(__LINE__, #__VA_ARGS__, __VA_ARGS__)

template<typename Arg> void __print(const string& name, Arg&& arg) {
    cerr << "[" << name << ": " << arg << "]" << " ";
}

void __printLine(int line) {
    cerr << "LINE " << line << ": ";
    cerr << boolalpha;    
}

template<typename Arg> void __g(vector<string>& names, int idx, Arg&& arg) {
    __print(names[idx], arg);
}

template<typename Arg, typename... Args> void __g(vector<string>& names, int idx, Arg&& arg, Args&&... args) {
    __g(names, idx, arg); __g(names, idx + 1, args...);
}

template <typename Arg> void __f(int line, const string& name, Arg&& arg) {
    __printLine(line);
    __print(name, arg); CLEAR();
}

template <typename Arg, typename... Args> void __f(int line, const string& _names, Arg&& arg, Args&&... args) {
    __printLine(line);
    vector<string> names = split(_names, ", "); __g(names, 0, arg, args...); CLEAR();
}
#else
#define DEBUG(...)
#endif
// DEBUGGING_UTILITIES_END

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const double epsilon = 1e-8;
const int infinite    = 2000000000; // 2 * 10^9
const long long infiniteLL = 2000000000000000000LL; // 2 * 10^18
const long long modulo = 1000000007;
const int MAXHEIGHT = 1000000;

struct Line {
    long long m, c;

    Line(long long _m = 0, long long _c = infiniteLL) {
        m = _m, c = _c;
    }

    long long f(long long x) {
        return m * x + c;
    }
};

struct SegmentTree {
    int N;
    vector<Line> tree;

    void initialize(int _N) {
        N = _N;
        tree.resize(4 * N);
    }

    void insert(int node, int b, int e, Line line) {
        int mid = (b + e) / 2;
        bool leftEnd = line.f(b) < tree[node].f(b);
        bool middleEnd = line.f(mid) < tree[node].f(mid);

        if (middleEnd) {
            swap(line, tree[node]);
        }

        if (b == e) {
            return;
        }

        if (leftEnd != middleEnd) {
            insert(2 * node, b, mid, line);
        } else {
            insert(2 * node + 1, mid + 1, e, line);
        }
    }

    long long query(int node, int b, int e, int x) {
        long long answer = tree[node].f(x);

        if (b == e) {
            return answer;
        } else {
            int mid = (b + e) / 2;

            if (x <= mid) {
                return min(answer, query(2 * node, b, mid, x));
            } else {
                return min(answer, query(2 * node + 1, mid + 1, e, x));
            }
        }
    }

    void insert(Line line) {
        insert(1, 0, N - 1, line);
    }

    long long query(int x) {
        return query(1, 0, N - 1, x);
    }
};

struct Frog3 {
    int N;
    long long C;
    vector<long long> heights;
    vector<long long> dp;
    SegmentTree tree;

    void initialize(int _N, long long _C, vector<long long>& _heights) {
        N = _N, C = _C, heights = _heights;
    }

    long long square(long long x) {
        return x * x;
    }

    long long solve() {
        tree.initialize(MAXHEIGHT + 1);
        dp.resize(N);
        dp[0] = 0;

        for (int i = 0; i < N; ++i) {
            if (i > 0) {
                dp[i] = square(heights[i]) + C + tree.query(heights[i]);
            }

            tree.insert(Line(-2 * heights[i], square(heights[i]) + dp[i]));
        }

        return dp[N - 1];
    }
};

struct Task {
    int N;
    vector<long long> heights;
    long long C;
    Frog3 frog;

    void readInput() {
        N = readInt(), C = readLongLong();
        heights.resize(N);

        for (auto& h : heights) {
            h = readInt();
        }
    }

    void solve() {
        frog.initialize(N, C, heights);
        long long result = frog.solve();
        printf("%lld\n", result);
    }

    void perform() {
        readInput();
        solve();
    }
};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    Task task;
    task.perform();

    return 0;
}

// Powered by PhoenixAI


Measured memory_bytes: 70628