Submission #38029964

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

const int Max = 200005;

long long n, a[Max], flip, x[Max], s, t;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr), cout.tie(nullptr);
	
	cin >> n >> a[0];
	flip = a[0];
	a[0] = 1;
	
	for (int i = 1; i < n; i++) {
		cin >> a[i];
		a[i] *= flip;
		x[i] = i;
		
		if (a[i] > 0)
			s += x[i];
		else
			t += x[i];
	}
	
	if (s > t) 
		x[0] -= s - t;
	else {
		auto dif = t - s;
		for (int i = n - 1; i >= 0; i--) {
			x[i] += dif;
			if (a[i] > 0)
				s += dif;
			else
				t += dif;
			if (s == t) 
				goto print;
		}
		
		s = t = 0;
		for (int i = 0; i < n; i++) {
			x[i] = i;
			if (a[i] > 0)
				s += x[i];
			else
				t += x[i];
		}
		
		for (int i = 0; i < n; i++) {
			x[i] -= dif;
			if (a[i] > 0)
				s -= dif;
			else
				t -= dif;
			if (s == t)
				goto print;
		}
		
		cout << "No" << endl;
		return 0;
	}
	
	print:
	cout << "Yes" << endl;
	for (int i = 0; i < n; i++) 
		cout << x[i] << ' ';
}

Submission Info

Judge Result