-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAbsCin.java
More file actions
40 lines (38 loc) · 1.34 KB
/
AbsCin.java
File metadata and controls
40 lines (38 loc) · 1.34 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
import java.util.*;
import java.io.*;
public class AbsCin {
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
PrintWriter out = new PrintWriter(System.out);
int t = Integer.parseInt(br.readLine());
while (t-- > 0) {
int n = Integer.parseInt(br.readLine());
long[] f = new long[n + 1];
StringTokenizer st = new StringTokenizer(br.readLine());
for (int i = 1; i <= n; i++) {
f[i] = Long.parseLong(st.nextToken());
}
if (n == 2) {
out.println(f[2] + " " + f[1]);
continue;
}
long[] a = new long[n + 1];
long sumMid = 0;
long wSumMid = 0;
for (int i = 2; i < n; i++) {
a[i] = (f[i + 1] - 2 * f[i] + f[i - 1]) / 2;
sumMid += a[i];
wSumMid += a[i] * (i - 1);
}
long diff = f[2] - f[1];
long tar = f[1] - wSumMid + (n - 1) * (sumMid + diff);
a[1] = tar / (n - 1);
a[n] = a[1] - sumMid - diff;
for (int i = 1; i <= n; i++) {
out.print(a[i] + (i == n ? "" : " "));
}
out.println();
}
out.flush();
}
}