虽然很水,但是我还是WA了一发呜呜呜
没有考虑到只有一个数的情况。
AC代码
#include <iostream>
using namespace std;
using LL = long long;
int main()
{
LL max = -0x7f7f7f7f7f7f7f7f;
LL min = 0x7f7f7f7f7f7f7f7f;
LL sum = 0;
LL tmp;
LL n;
cin >> n;
if (n == 1) {
cin >> tmp;
cout << tmp << endl;
return 0;
}
for (int i = 0; i < n; ++i) {
cin >> tmp;
if (tmp > max) {
max = tmp;
}
if (tmp < min) {
min = tmp;
}
sum += (tmp > 0) ? tmp : -tmp;
}
if (max < 0) {
sum += 2 * max;
}
if (min > 0) {
sum -= 2 * min;
}
cout << sum << endl;
return 0;
}