Problem:
 Score : 300 points    Problem Statement There are N sightseeing spots on the x -axis, numbered 1, 2, ..., N .
Spot i is at the point with coordinate A_i .
It costs |a - b| yen (the currency of Japan) to travel from a point with coordinate a to another point with coordinate b along the axis.  You planned a trip along the axis.
In this plan, you first depart from the point with coordinate 0 , then visit the N spots in the order they are numbered, and finally return to the point with coordinate 0 .  However, something came up just before the trip, and you no longer have enough time to visit all the N spots, so you decided to choose some i and cancel the visit to Spot i .
You will visit the remaining spots as planned in the order they are numbered.
You will also depart from and return to the point with coordinate 0 at the beginning and the end, as planned.  For each i = 1, 2, ..., N , find the total cost of travel during the trip when the visit to Spot i is canceled.      Constraints  2 \leq N \leq 10^5  -5000 \leq A_i \leq 5000 ( 1 \leq i \leq N )  All input values are integers.         Input Input is given from Standard Input in the following format:  N  A_1  A_2  ...  A_N       Output Print N lines.
In the i -th line, print the total cost of travel during the trip when the visit to Spot i is canceled.        Sample Input 1 3
3 5 -1      Sample Output 1 12
8
10  Spot 1 , 2 and 3 are at the points with coordinates 3 , 5 and -1 , respectively.
For each i , the course of the trip and the total cost of travel when the visit to Spot i is canceled, are as follows:   For i = 1 , the course of the trip is 0 \rightarrow 5 \rightarrow -1 \rightarrow 0 and the total cost of travel is 5 + 6 + 1 = 12 yen.  For i = 2 , the course of the trip is 0 \rightarrow 3 \rightarrow -1 \rightarrow 0 and the total cost of travel is 3 + 4 + 1 = 8 yen.  For i = 3 , the course of the trip is 0 \rightarrow 3 \rightarrow 5 \rightarrow 0 and the total cost of travel is 3 + 2 + 5 = 10 yen.        Sample Input 2 5
1 1 1 2 0      Sample Output 2 4
4
4
2
4       Sample Input 3 6
-679 -2409 -3258 3095 -3291 -4462      Sample Output 3 21630
21630
19932
8924
21630
19288

Solution (Python):
n = int(input())
a=[0]
a.extend(list(map(int,input().split())))
a.append(0)
t=0
no=0
for i in a:
    t+=abs(no-i)
    no=i
for k in range(n):
    i=k+1
    s=(abs(a[i-1]-a[i+1]))-(abs(a[i-1]-a[i])+abs(a[i]-a[i+1]))
    print(t+s)

Solution (Python):
n = int(input().strip())
a = list(map(int, input().strip().split(" ")))
a.append(0)
a.insert(0, 0)
s = [abs(j - i) for i, j in zip(a, a[1:])]
base = sum(s)
for i in range(1, n + 1):
    if min(a[i - 1], a[i + 1]) <= a[i] <= max(a[i - 1], a[i + 1]):
        print(base)
    elif max(a[i - 1], a[i + 1]) < a[i]:
        print(base - 2 * abs(a[i] - max(a[i - 1], a[i + 1])))
    else:
        print(base - 2 * abs(a[i] - min(a[i - 1], a[i + 1])))

Solution (Python):
n=int(input())
a=list(map(int,input().split()))
a.insert(0,0)
a.append(0) 
n=len(a)
tot=0
for i in range(n-1):
    tot+=abs(a[i]-a[i+1])
tot2=0
for i in range(1,n-1):
    tot2+=abs(a[i]-a[i-1])+abs(a[i]-a[i+1])-abs(a[i-1]-a[i+1])
    print(tot-tot2)
    tot2=0

Solution (Python):
N = int(input())
A = list(map(int, input().split()))
allpoint = abs(A[0])
for i in range(N):
    if i < N-1:
        allpoint += abs(A[i]-A[i+1])
    else:
        allpoint += abs(A[i])

for i in range(N):
    if i == 0:
        print(allpoint+abs(A[i+1])-abs(A[i])-abs(A[i]-A[i+1]))
    elif i == N-1:
        print(allpoint+abs(A[i-1])-abs(A[i]-A[i-1])-abs(A[i]))
    else:
        print(allpoint+abs(A[i+1]-A[i-1])-abs(A[i]-A[i-1])-abs(A[i]-A[i+1]))

Solution (Python):

def calc(N, A, i):
    x = 0
    r = 0
    for j, a in enumerate(A):
        if j == i:
            continue
        r += abs(x - a)
        x = a
    r += abs(x)
    return r

def calc0(N, A):
    x = 0
    r = 0
    for a in A:
        r += abs(x - a)
        x = a
    return r

def calc1(N, A, ra, i):
    x0 = A[i - 1]
    x1 = A[i]
    x2 = A[i + 1]
    return ra - abs(x0 - x1) - abs(x1 - x2) + abs(x0 - x2)




N = int(input())
A = [int(_) for _ in input().split()]
A += [0]

ra = calc0(N, A)

for i in range(N):
    print(calc1(N, A, ra, i))

Solution (Python):
N = int(input())
A = list(map(int, input().split()))

All = abs(A[0]) + abs(A[-1])
for i in range(len(A)-1):
    All += abs(A[i+1] - A[i])

print(All - ( abs(A[0]) + abs(A[1]-A[0])) + abs(A[1]))
for i in range(1, len(A)-1):
    print(All- (abs(A[i+1]-A[i]) + abs(A[i-1] - A[i])) + abs(A[i+1]-A[i-1]))

print(All - (abs(A[-1])+abs(A[-1]-A[-2])) + abs(A[-2]))

Solution (Python):
n = int(input())
data = list(map(int, input().split(" ")))
data.insert(0,0)
data.append(0)
allans = 0
for i in range(0, len(data)-1):
    allans += abs(data[i+1]-data[i])
for i in range(1, len(data)-1):
    temp=abs(data[i]-data[i-1])
    temp2=abs(data[i+1]-data[i])
    temp3=abs(data[i+1]-data[i-1])
    print(allans-temp-temp2+temp3)

Solution (Python):
n = int(input())
a = [0] + list(map(int, input().split())) + [0]
c = 0
for i in range(1, len(a)): c += abs(a[i] - a[i - 1])
for i in range(1, len(a) - 1):
	print(c - abs(a[i] - a[i - 1]) - abs(a[i + 1] - a[i]) + abs(a[i + 1] - a[i - 1]))

Solution (Python):


n = int(input())
a = list(map(int, input().split()))
assert len(a) == n

a.append(0)

def all_path(a):
    res = 0
    now = 0
    for p in a:
        res += abs(now - p)
        now = p
    return res

def remove(a, i):
    if i == 0:
        prev = 0
    else:
        prev = a[i - 1]
    post = a[i + 1]
    now = a[i]
    orig = abs(now - prev) + abs(now - post)
    skip = abs(prev - post)
    return orig - skip

ap = all_path(a)

for i in range(n):
    print(ap - remove(a, i))