#750 div2 D. Vupsen, Pupsen and 0

题意

有a 数组
构建一个b数组使得

要求1
b中不能 出现0
要求2
sum不能超过1e9

思路

一对一对来计算
比如

然后如果是奇数的话
就最后三个考虑
小细节是两两相加可能为0

AC代码

#include <bits/stdc++.h>
#define endl "\n" 
#define INF 0x3f3f3f3f3f3f3f3f
#define IO ios::sync_with_stdio(false);cin.tie();cout.tie(0)
using namespace std;
typedef long long ll;
const  ll mod = 1e9 + 7;
const   double  PI = acos(-1.0);
const double EI = exp(1.0);
const int  N = 5e5 + 10;
const int maxn = 2 * N;
const double  eps = 1e-8;
int a[N];
ll gcd(ll a, ll b)
{
	if (a % b == 0)return b;
	else return gcd(b, a % b);
}
void solve()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
		cin >> a[i];
	if (n%2==0)
	{
		for (int i = 1; i <= n; i += 2)
		{
			int gcdx = gcd(fabs(a[i]), fabs(a[i + 1]));
			cout << -1*a[i + 1] / gcdx << " " << a[i] / gcdx << " ";
		}
	}
	else
	{
		int gcdx, sum;
		for (int i = 1; i < n-2; i += 2)
		{
			 gcdx = gcd(fabs(a[i]), fabs(a[i + 1]));
			cout << -1 * a[i + 1] / gcdx << " " << a[i] / gcdx << " ";
		}
		if (a[n - 2] + a[n - 1] != 0)
		{
			cout << a[n] << " " << a[n] << " " << -1 * (a[n - 2] + a[n - 1])<<" ";
		}
		else if (a[n - 1] + a[n] != 0)
		{

			cout << -1*(a[n - 1] + a[n]) << " " << a[n-2] << " " << a[n - 2] << " ";
		}
		else if (a[n - 2] + a[n] != 0)
		{
			cout << a[n - 1] << " " <<-1*( a[n - 2] + a[n]) << " " << a[n - 1] << " ";
		}

	}
	cout << endl;
}
int main()
{
	std::ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	int t; cin >> t; while (t--)
		solve();
	return 0;
}