/// __Macro's__
#include <bits/stdc++.h>
using namespace std;
#define ll                   long long
#define II                   pair<int,int>
#define III                  pair<int, II>
#define VL                   vector<ll>
#define VI                   vector<int>
#define VII                  vector<II>
#define VIII                 vector<III>
#define VVI                  vector<vector<int>>
#define VVII                 vector<vector<II>>
#define fr                   first
#define sc                   second
#define mkpr                 make_pair
#define PQ                   priority_queue
#define pb                   push_back
#define eb                   emplace_back
#define all(v)               v.begin(), v.end()
#define LINE                 putc('\n', stdout)
#define SPACE                putc(' ' , stdout)
#define TAB                  putc('\t', stdout)
#define msg(x)               printf(#x)
#define fillarr(arr, val)    fill((int*)arr, (int*)arr+(sizeof(arr)/sizeof(int)), val)
#define _log2(x)             (31^__builtin_clz(x))
#define INF                  1000000007 
#define MOD                  1000000007 
#define getint ReadInt()
const char IO_MODE = 0; // in-->00<--out (MSB-->LSB) | 0: Norm, 1: Fast 
constexpr ll operator "" _K(unsigned ll n) {return 1000*n;}
constexpr ll operator "" _M(unsigned ll n) {return 1000000*n;}
void operator "" _print(char const* s, size_t n) {printf("%s\n", s);}
inline ll ReadInt(){ll x=0,s=1;char c=getchar();while(c<'0'||c>'9'){if(c=='-')s=-1;c=getchar();}while(c>='0'&&c<='9'){x=x*10+c-'0';
c=getchar();}return s*x;}inline void WriteInt(ll x){char c[20];if(!x){putchar('0');return;}if(x<0)putchar('-'),x=-x;int i=0;while(x>0)
c[++i]=x%10,x/=10;while(i)putchar(c[i--]+48);}template <typename T>inline void out(T x){if(IO_MODE&1)WriteInt(x);else if(typeid(x)==typeid(int))
printf("%i", x);else if(typeid(x)==typeid(ll)) printf("%lld", x);}template<typename T, typename... Args>inline void out(T x,Args...args)
{out(x);SPACE;out(args...);}template <typename T>inline void in(T &x){if(IO_MODE&2) x=ReadInt();else if(typeid(x)==typeid(int))
scanf("%i",&x);else if(typeid(x)==typeid(ll)) scanf("%lld",&x);}template<typename T, typename... Args>
inline void in(T &x,Args&...args){in(x);in(args...);}
int aa,bb,cc,dd,ee,ff,gg,hh,ii,jj,kk,mm,nn,oo,pp,qq,rr,ss,tt,uu,vv,ww,xx,yy,zz;
int tc;
///

#define int long long 
struct sol{
  int x;
  int p;
  int getCost(int y){
    return p + (x-y)*(x-y);
  }
  int intersect(sol &o)
  {
    int lo = o.x;
    int hi = o.x;
    while(hi<1e17 && getCost(hi) < o.getCost(hi)) lo=hi, hi<<=1;
    if(hi>=1e17) return hi;
    while(lo<hi)
    {
      int mid=lo+hi>>1;
      if(getCost(mid) >= o.getCost(mid)) hi=mid;
      else lo=mid+1;
    }
    return hi;
    // return (int) ceil( 0.5*(p-o.p)/(x-o.x) + 0.5*(x+o.x));
  }
};

int n,c;
 main()
{
  in(n,c);
  int best;
  deque<sol> dq;
  for(int i=0 ; i<n ; i++)
  {
    int x = getint;
    int sz = dq.size();
    
    while(sz>=2 && dq[0].getCost(x) >= dq[1].getCost(x)) dq.pop_front(), sz--;

    best = sz ? dq.front().getCost(x) : 0 ;
    sol s = sol({x, best+c}); //sz++;
    while(sz>=2 && dq[sz-2].intersect(dq[sz-1]) >= dq[sz-1].intersect(s)) dq.pop_back(), sz--;
    dq.push_back(s);

  }
  cout << best << endl;
}

Measured memory_bytes: 2432