#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll modpow(ll x, ll p) { ll result = 1, now = 1, pm = x; while (now<=p) { if (p&now) { result = result * pm % MOD; } now*=2; pm = pm*pm % MOD; } return result; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> N; ll A[N]; rep(i,N) cin >> A[i]; assert(1<=N && N<=2*pow(10,5)); rep(i,N) assert(0<=A[i] && A[i]<=2*pow(10,5)); ll MA = 2*pow(10,5) + 10; set s = {0}; priority_queue pq; pq.push((range){0,MA}); ll result = 0; rep(i,N) { ll d = A[i] - *(--s.upper_bound(A[i])); if (!d) continue; queue q; while (pq.size() && pq.top().d()>d) { range now = pq.top(); pq.pop(); q.push((range){now.l, now.l+d}); q.push((range){now.l+d, now.r}); s.insert(now.l+d); } while (q.size()) { pq.push(q.front()); q.pop(); } result++; // for (auto x: s) cout << x << " "; cout << endl; } cout << result << endl; return 0; }