有没有考虑过，`long long` 的 $a_i$，有可能会大于 `INT_MAX`。
by IGJHL @ 2022-10-02 21:47:12
@[OI_Loser_IGJHL](/user/357463) 所造成的后果就是找不到最小值。
by IGJHL @ 2022-10-02 21:51:32
```
#include <bits/stdc++.h>
using namespace std;
long long a[10000010];
long long maxx = -1000000000000000, minn = 11000000000000000000000;
int main() {
long long n;
cin >> n;
for (int i = 1; i <= n; i++) {
long long m;
cin >> m;
a[i] = m;
if (m > maxx)
maxx = m;
if (m < minn)
minn = m;
}
for (int i = 1; i <= n; i++) {
cout << maxx - a[i] << ' ';
}
cout << endl;
for (int i = 1; i <= n; i++) {
cout << a[i] - minn << ' ';
}
cout << endl;
return 0;
}```
```
~~最直接的方法.......~~
by zhangxiuping1393 @ 2022-10-02 21:56:51