Language: C++

#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}
string YN(bool v) { return v ? "Yes":"No"; }

#define INF (1LL<<40)

// 下に凸な関数fの最小値
ll ternarySearch(std::function<ll(ll)> f, ll lb, ll ub) {
	while(1) {
		ll a = lb+(ub-lb)/3;
		ll b = lb+(ub-lb)*2/3;
//		DD(lb);DD(a);DD(b);DD(ub);
		if(lb+3 >= ub) {
			if(f(a)<f(b)) return a; else return b;
			break;
		}
		if(f(a)<f(b)) ub=b; else lb=a;
	}
	return (ub-lb)/2;
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N,M,W,H;
	string s;
	while(cin>>N) {
		VI A(N);
		REP(i, N) cin>>A[i];
		auto f = [&](ll b) {
			ll v = 0;
			REP(i, N) v += abs(A[i]-(b+i+1));
//			DD(b);DD(v);
			return v;
		};
		ll ans = f(ternarySearch(f, -INF, INF));
		cout<<ans<<endl;
//		break;
	}
	
	return 0;
}


Compiler output:
a.cc:64:23: error: 'function' is not a member of 'std'
   64 | ll ternarySearch(std::function<ll(ll)> f, ll lb, ll ub) {
      |                       ^~~~~~~~
a.cc:23:1: note: 'std::function' is defined in header '<functional>'; this is probably fixable by adding '#include <functional>'
   22 | #include <cassert>
  +++ |+#include <functional>
   23 | using namespace std;
a.cc:27:12: error: expected primary-expression before 'long'
   27 | #define ll long long
      |            ^~~~
a.cc:64:32: note: in expansion of macro 'll'
   64 | ll ternarySearch(std::function<ll(ll)> f, ll lb, ll ub) {
      |                                ^~
a.cc:27:12: error: expected primary-expression before 'long'
   27 | #define ll long long
      |            ^~~~
a.cc:64:43: note: in expansion of macro 'll'
   64 | ll ternarySearch(std::function<ll(ll)> f, ll lb, ll ub) {
      |                                           ^~
a.cc:27:12: error: expected primary-expression before 'long'
   27 | #define ll long long
      |            ^~~~
a.cc:64:50: note: in expansion of macro 'll'
   64 | ll ternarySearch(std::function<ll(ll)> f, ll lb, ll ub) {
      |                                                  ^~
a.cc:64:55: error: expression list treated as compound expression in initializer [-fpermissive]
   64 | ll ternarySearch(std::function<ll(ll)> f, ll lb, ll ub) {
      |                                                       ^
a.cc: In function 'int main()':
a.cc:92:41: error: 'ternarySearch' cannot be used as a function
   92 |                 ll ans = f(ternarySearch(f, -INF, INF));
      |                            ~~~~~~~~~~~~~^~~~~~~~~~~~~~