提出 #70605761

---

ソースコード 拡げる

#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n; cin >> n;
	vector<int>x(n + 1);
	rep2(i, 1, n + 1)cin >> x[i];
	long long ans = 2 * INF;
	set<long long>st = { -INF * 2,0,INF * 2 };
	map<int, int>mp;
	mp[0] = 0;
	// 門番が必須
	auto before = [&](long long n)->long long {
		auto ite = prev(st.lower_bound(n));
		return *ite;
	};
	auto after = [&](long long n)->long long {
		auto ite = st.upper_bound(n);
		return *ite;
	};

	rep2(i, 1, n + 1) {
		int b = before(x[i]);
		int a = after(x[i]);
		ans += min(a - x[i], x[i] - b);
		if (abs(b) != INF * 2) {
			int b2 = before(b);
			int a2 = after(b);
			ans -= min(a2 - b, b - b2);
		}
		if (abs(a) != INF * 2) {
			int b2 = before(a);
			int a2 = after(a);
			ans -= min(a2 - a, a - b2);
		}
		st.insert(x[i]);
		if (abs(b) != INF * 2) {
			int b2 = before(b);
			int a2 = after(b);
			ans += min(a2 - b, b - b2);
		}
		if (abs(a) != INF * 2) {
			int b2 = before(a);
			int a2 = after(a);
			ans += min(a2 - a, a - b2);
		}
		cout << ans << endl;
	}
	return 0;
}

提出情報

ジャッジ結果