Educational Codeforces Round 103 (Rated for Div. 2)

F.(

题意:n个灯笼排成一排,每个灯笼可以照亮(i - p[i], i - 1)(向左)或者(i + 1, i + p[i])(向右).要求摆放灯笼使得所有灯笼都被照亮.

可行性转最优性,考虑前i个灯笼最多能照亮的灯笼f[i].

1.if f[i - 1] < i, f[i] = f[i - 1]

2.if f[i - 1] >= i, f[i] = max(f[i], i + p[i])向右.

3.第i个灯笼向左,照亮范围内的灯笼全部向右.用二分+ST表即可.

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x))
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
// namespace nqio { const unsigned R = 4e5, W = 4e5; char* a, * b, i[R], o[W], * c = o, * d = o + W, h[40], * p = h, y; bool s; struct q { void r(char& x) { x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++; } void f() { fwrite(o, 1, c - o, stdout); c = o; } ~q() { f(); }void w(char x) { *c = x; if (++c == d) f(); } q& operator >>(char& x) { do r(x); while (x <= 32); return *this; } q& operator >>(char* x) { do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this; } template<typename t> q& operator>>(t& x) { for (r(y), s = 0; !isdigit(y); r(y)) s |= y == 45; if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this; } q& operator <<(char x) { w(x); return *this; }q& operator<< (char* x) { while (*x) w(*x++); return *this; }q& operator <<(const char* x) { while (*x) w(*x++); return *this; }template<typename t> q& operator<< (t x) { if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p); return *this; } }qio; }using nqio::qio;
using namespace std;
mt19937 rnd(random_device{}());
const int N = 3e5 + 10;
int n, p[N], f[N], st[N][22];
int ask(int l, int r) {
	if (l > r) return 0;
	// cout << l << " " << r << "\n";
	int k = __lg(r - l + 1);
	return max(st[l][k], st[r - (1ll << k) + 1][k]);
}
void solve() {
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> p[i];
		st[i][0] = i + p[i];
	}
	for (int j = 1; j <= __lg(n); ++j) {
		for (int i = 1; i + (1ll << j) - 1 <= n; ++i) {
			st[i][j] = max(st[i][j - 1], st[i + (1ll << (j - 1))][j - 1]);
		}
	}
	f[0] = f[1] = 0;
	// cout << ask(1, 3) << "\n";
	for (int i = 2; i <= n; ++i) {
		f[i] = f[i - 1];
		if (f[i - 1] >= i) {
			f[i] = max(f[i - 1], i + p[i]);
		}
		int l = 0, r = i - 1;
		while (l < r) {
			int mid = (l + r) >> 1;
			if (f[mid] >= i - p[i] - 1) r = mid;
			else l = mid + 1;
		}
		// cout << l << " ";
		if (f[l] >= i - p[i] - 1) {
			f[i] = max(f[i], max(i - 1, ask(l + 1, i - 1)));
		}
		// cout << l + 1 << " " << i - 1 << "\n";
		// cout << f[i] << "\n";
	}
	if (f[n] < n) {
		cout << "NO\n";
	}else {
		cout << "YES\n";
		vector<int> ans(n + 1, 0);
		for (int i = n; i >= 1; --i) {
			if (f[i] == f[i - 1]) continue;
			if (f[i] == i + p[i] && f[i - 1] >= i) ans[i] = 1;
			else {
				int l = 0, r = i - 1;
				while (l < r) {
					int mid = (l + r) >> 1;
					if (f[mid] >= i - p[i] - 1) r = mid;
					else l = mid + 1;
				}
				// if (f[l] >= i - p[i] - 1) {
				for (int j = l + 1; j <= i - 1; ++j) {
					ans[j] = 1;
				}
				ans[i] = 0;
				i = l + 1;
				// }
			}
		}
		for (int i = 1; i <= n; ++i) {
			cout << (ans[i] ? "R" : "L");
		}
		cout << "\n";
	}
}
signed main() {
	IOS;
	int T;
	cin >> T;
	while (T--) solve();
}