Submission #3607598

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REP(i,b) FOR(i,0,b)
#define RFOR(i,a,b) for (int i = a-1; i >= b; i--)
#define RREP(i,a) RFOR(i,a,0)
#define REPALL(i,v) for (int i = 0; i < v.size(); i++)
#define SORT(v) sort(v.begin(), v.end())
#define MIN_ELEMENT(v) min_element(v.begin(), v.end())
#define MAX_ELEMENT(v) max_element(v.begin(), v.end())
#define COUNT(v,n) count(v.begin(), v.end(), n);
typedef long long ll;
typedef unsigned long long ull;
const int INF = 1e7;
const ll MOD = 1e9 + 7;

vector<int> a;
int n, max1, max2, min1, min2, cost;

int main()
{
  cin>>n;
  a.push_back(0);
  REP(i,n) {
    int tmp;
    cin>>tmp;
    a.push_back(tmp);
  }
  a.push_back(0);

  REP(i,n+1) {
    cost += abs(a[i+1] - a[i]);
  }

  REP(i,n) {
    int pd = abs(a[i+1] - a[i]) + abs(a[i+2] - a[i+1]);
    int cd = abs(a[i+2] - a[i]);
    if (pd == cd) {
      cout<<cost<<endl;
    } else {
      cout<<cost - pd + cd<<endl;
    }
  }

  return 0;
}

Submission Info

Judge Result