CF Edu119 F. Bipartite Array题解

不难发现充要条件就是不能出现i < j < k，ai > aj > ak

最暴力的dp，考虑可行性dp，dp(ps, x, y)表示考虑到ps位置，前面aj最大的ai > aj = x，ai最大的ai = y这一方案是否存在。显然这样状态数就已经爆了，发现x一定时y越小越好，因此用最值dp优化。

dp(ps, x)表示考虑到ps位置，出现了ai > aj = x时，之前的y能取到的最小值。然后又发现x增大时y单调不增，因此可以用线段树区间修改优化dp更新。

恶心之处在于还要输出方案...

//#define LOCAL
#include<bits/stdc++.h>
#define pii pair<int,int>
#define fi first
#define sc second
#define pb push_back
#define ll long long
#define trav(v,x) for(auto v:x)
#define all(x) (x).begin(), (x).end()
#define VI vector<int>
#define VLL vector<ll>
#define pll pair<ll, ll>
#define double long double
//#define int long long
using namespace std;
const int N = 1e6 + 100;
const int inf = 1e9;
//const ll inf = 1e18
const ll mod = 998244353;//1e9 + 7

#ifdef LOCAL
void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T)
{
	cerr << " " << to_string(H);
	debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif


int n, bas;
int a[N];

int seg[N * 8], laz[N * 8];

#define mid ((l + r) >> 1)
#define ls (k << 1)
#define rs (k << 1 | 1)

void push_up(int k)
{
	seg[k] = min(seg[ls], seg[rs]);
	return;
}

void push_down(int k)
{
	if(laz[k])
	{
		seg[ls] = seg[rs] = laz[k];
		laz[ls] = laz[rs] = laz[k];
		laz[k] = 0;
	}
}

void build(int l = 1, int r = n + bas, int k = 1)
{
	laz[k] = 0;
	if(l == r)
	{
		return (void)(seg[k] = -inf);
	}
	build(l, mid, ls);
	build(mid + 1, r, rs);
	push_up(k);
}

int ask(int val, int l = 1, int r = n + bas, int k = 1)
{
	if(l == r)
	{
		if(seg[k] <= val)
			return l;
		return n + bas + 1;
	}
	push_down(k);
	if(seg[ls] <= val)
		return ask(val, l, mid, ls);
	return ask(val, mid + 1, r, rs);
}

int cal_val(int to, int l = 1, int r = n + bas, int k = 1)
{
	if(l == r)
		return seg[k];
	if(l < r)
		push_down(k);
	if(to <= mid)
		return cal_val(to, l, mid, ls);
	return cal_val(to, mid + 1, r, rs);
}

void upd(int L, int R, int val, int l = 1, int r = n + bas, int k = 1)
{
	if(l > R || r < L)
		return;
	if(L <= l && r <= R)
	{
		seg[k] = val;
		laz[k] = val;
		return;
	}
	if(l < r)
		push_down(k);
	upd(L, R, val, l, mid, ls);
	upd(L, R, val, mid + 1, r, rs);
	push_up(k);
	return;
}

int lp[N], rp[N], ans[N], vvv[N][4];
struct Cg{
	int l, r, val;
	bool need;
}cg[N][4];

void dfs(int l = 1, int r = n + bas, int k = 1)
{
	if(l == r)
	{
		cerr << seg[k] - bas << ' ';
		return;
	}
	if(l < r)
		push_down(k);
	dfs(l, mid, ls);
	dfs(mid + 1, r, rs);
	return;
}

void sol()
{
	cin >> n;
	for(int i = 1; i <= n; i++)
		cin >> a[i];
	bas = n + 2;
	build();
	auto get = [&](int id, int bg, int l, int r, int y)
	{
		cg[id][bg].need = 0;
		cg[id][bg + 1].need = 0;
		if(l > r)
			return;
		if(l <= y)
		{
			cg[id][bg].need = 1;
			int tmp = cal_val(y);
			cg[id][bg].l = y;
			cg[id][bg].val = tmp;
			vvv[id][bg] = tmp;
		}
		++bg;
		if(y <= r)
		{
			cg[id][bg].need = 1;
			cg[id][bg].l = max(l, y);
			cg[id][bg].val = y;
			vvv[id][bg] = cal_val(cg[id][bg].l);
		}
		return;
	};
	auto doit = [&](int l, int r, int val)
	{
	//	cerr << "GGG" << l - bas <<  ' ' << r - bas << ' ' << val - bas << '\n';
		if(l <= r)
			upd(l, r, val);
	};
	for(int i = 1; i <= n; i++)
	{
		int x = -a[i] + bas;
		int y = a[i] + bas;
		if(seg[1] == inf)
			return (void)(cout << "NO" << '\n');
		lp[i] = ask(y);
		rp[i] = ask(x);
	//	cerr << i << ' ' << lp[i] - bas << ' ' << rp[i] - bas << '\n';
		get(i, 0, lp[i], n + bas, y);// positive
		get(i, 2, rp[i], n + bas, x);//negative
		upd(1, n + bas, inf);
		//cerr << "!!" << '\n';
		for(int j = 0; j < 4; j++)
		{
			if(cg[i][j].need)
			{
				cg[i][j].r = ask(cg[i][j].val) - 1;
				//cerr << i << ' ' << j << ' ' << cg[i][j].l - bas << ' ' << cg[i][j].val - bas << '\n';
				doit(cg[i][j].l, cg[i][j].r, cg[i][j].val);
			}
		}
//		cerr << "!!" << i << '\n';
//		dfs();
//		cerr << '\n';
	}
	if(seg[1] == inf)
		return (void)(cout << "NO" << '\n');
	int ps = n + bas;
	int val = seg[1];
	for(int i = n; i >= 1; i--)
	{
		bool flg = 0;
		for(int j = 0; j < 4; j += 2)
		{
			if(!cg[i][j].need)
				continue;
			if(cg[i][j].l <= ps && cg[i][j].r >= ps && cg[i][j].val == val)
			{
				flg = 1;
				if(j <= 1)
				{
					ans[i] = 1;
					ps = a[i] + bas;
					val = vvv[i][0];
				}
				else
				{
					ans[i] = -1;
					ps = -a[i] + bas;
					val = vvv[i][2];
				}
				break;
			}
		}
		if(!flg)
		{
			if(val == a[i] + bas)
			{
				ans[i] = 1;
				ps = cg[i][1].l;
				val = vvv[i][1];
			}
			else
			{
				ans[i] = -1;
				ps = cg[i][3].l;
				val = vvv[i][3];
			}
		}
	}
	cout << "YES" << '\n';
	for(int i = 1; i <= n; i++)
		cout << a[i] * ans[i] << ' ' ;
	cout << '\n';
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt;
	cin >> tt;
	while(tt--)
		sol();
}