Submission #3226422

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cassert>
#include <stack>
#include <limits>
#include <array>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <memory>
#include <numeric>
#include <tuple>

constexpr long long mod = static_cast<long long>(1e9 + 7);

struct Data
{
  int _1;
  int _2;
};

int main() {
  int N;
  std::cin >> N;
  std::vector<int> A(N + 1);
  A[0] = 0;
  for(int i = 1; i < A.size(); ++i)
    std::cin >> A[i];

  std::vector<Data> p(N + 1);
  for(int i = 0; i < N - 1; ++i)
  {
    p[i]._1 = std::abs(A[i] - A[i + 1]);
    p[i]._2 = std::abs(A[i] - A[i + 2]);
  }
  p[N - 1]._1 = std::abs(A[N - 1] - A[N]);
  p[N - 1]._2 = std::abs(A[N - 1] - A[0]);
  p[N]._1 = std::abs(A[N] - A[0]);

  int ans = 0;
  for (auto&& d: p)
    ans += d._1;

  for (int i = 0; i < N; ++i)
  {
    std::cout << (ans - p[i]._1 - p[i + 1]._1 + p[i]._2) << '\n';
  }
  std::cout << std::flush;
  return 0;
}

Submission Info

Judge Result