cdq分治优化1D

//https://www.luogu.com.cn/problem/P2487
#include<bits/stdc++.h>
#include<unordered_map>
#include<array>
#define ll long long
#define ull unsigned long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;

const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const ll mod = 998244353;
const int N = 5e4 + 5;

int n, p[N], dp1[N], dp2[N];//dp1[i]表示以i结尾的最长上升子序列， dp2[i]表示以i开头的最长上升子序列
double g1[N], g2[N];//g1[N]表示以i结尾的最长上升子序列数量， g2表示以i开头的最长上升子序列数量
struct node {
	int h, v, id;
}a[N];
struct Node {
	int l, r, mx;
	double sum;
}tree[N << 2];

void build(int l, int r, int p)
{
	tree[p].l = l;
	tree[p].r = r;
	if (l == r)
		return;
	int mid = (l + r) / 2;
	build(l, mid, p << 1);
	build(mid + 1, r, p << 1 | 1);
}

void push_up(int p)
{
	if (tree[p << 1].mx > tree[p << 1 | 1].mx)
	{
		tree[p].mx = tree[p << 1].mx;
		tree[p].sum = tree[p << 1].sum;
	}
	else if (tree[p << 1].mx < tree[p << 1 | 1].mx)
	{
		tree[p].mx = tree[p << 1 | 1].mx;
		tree[p].sum = tree[p << 1 | 1].sum;
	}
	else
	{
		tree[p].mx = tree[p << 1].mx;
		tree[p].sum = tree[p << 1].sum + tree[p << 1 | 1].sum;
	}
}

void update(int pos, int val, double num, int p)
{
	int l = tree[p].l, r = tree[p].r;
	if (l == r)
	{
		if (!val)
			tree[p].mx = tree[p].sum = 0;
		else if (tree[p].mx < val)
		{
			tree[p].mx = val;
			tree[p].sum = num;
		}
		else if (tree[p].mx == val)
			tree[p].sum += num;
		return;
	}
	int mid = (l + r) / 2;
	if (pos <= mid)
		update(pos, val, num, p << 1);
	else
		update(pos, val, num, p << 1 | 1);
	push_up(p);
}

pair<int, double> query(int ql, int qr, int p)
{
	int l = tree[p].l, r = tree[p].r;
	if (ql <= l && qr >= r)
		return { tree[p].mx, tree[p].sum };
	int mid = (l + r) / 2;
	pair<int, double> ans = { 0, 0 };
	if (ql <= mid)
		ans = query(ql, qr, p << 1);
	if (qr > mid)
	{
		auto it = query(ql, qr, p << 1 | 1);
		if (it.first > ans.first)
			ans = it;
		else if (it.first == ans.first)
			ans.second += it.second;
	}
	return ans;
}

bool cmp1(node& a, node& b)
{
	return a.v < b.v;
}

bool cmp2(node& a, node& b)
{
	return a.id < b.id;
}

void cdq1(int l, int r)处理dp1，g1
{
	if (l == r)
		return;
	int mid = (l + r) / 2;
	cdq1(l, mid);
	sort(a + l, a + mid + 1, cmp1);
	sort(a + mid + 1, a + r + 1, cmp1);//按v排序
	int i = mid;
	int j = r;
	while (j >= mid + 1)
	{
		while (i >= l && a[i].v >= a[j].v)
		{
			update(a[i].h, dp1[a[i].id], g1[a[i].id], 1);
			i--;
		}
		auto ans = query(a[j].h, n, 1);
		if (ans.first + 1 > dp1[a[j].id])
		{
			dp1[a[j].id] = ans.first + 1;
			g1[a[j].id] = ans.second;
		}
		else if (ans.first + 1 == dp1[a[j].id])
			g1[a[j].id] += ans.second;
		j--;
	}
	i = mid;
	j = r;
	while (j >= mid + 1)
	{
		while (i >= l && a[i].v >= a[j].v)
		{
			update(a[i].h, 0, 0, 1);
			i--;
		}
		j--;
	}
	sort(a + mid + 1, a + r + 1, cmp2);
	cdq1(mid + 1, r);
}

void cdq2(int l, int r)//处理dp2, g2
{
	if (l == r)
		return;
	int mid = (l + r) / 2;
	cdq2(mid + 1, r);
	sort(a + l, a + mid + 1, cmp1);
	sort(a + mid + 1, a + r + 1, cmp1);
	int i = l;
	int j = mid + 1;
	while (i <= mid)
	{
		while (j <= r && a[i].v >= a[j].v)
		{
			update(a[j].h, dp2[a[j].id], g2[a[j].id], 1);
			j++;
		}
		auto ans = query(1, a[i].h, 1);
		if (ans.first + 1 > dp2[a[i].id])
		{
			dp2[a[i].id] = ans.first + 1;
			g2[a[i].id] = ans.second;
		}
		else if (ans.first + 1 == dp2[a[i].id])
			g2[a[i].id] += ans.second;
		i++;
	}
	i = l;
	j = mid + 1;
	while (i <= mid)
	{
		while (j <= r && a[i].v >= a[j].v)
		{
			update(a[j].h, 0, 0, 1);
			j++;
		}
		i++;
	}
	sort(a + l, a + mid + 1, cmp2);
	cdq2(l, mid);
}

void Hash()
{
	sort(p + 1, p + 1 + n);
	int len = unique(p + 1, p + 1 + n) - p - 1;
	for (int i = 1; i <= n; i++)
		a[i].h = lower_bound(p + 1, p + 1 + len, a[i].h) - p;
}

void solve()//排序处理i, j, 分治处理v, 线段树处理h
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i].h >> a[i].v;
		a[i].id = i;
		p[i] = a[i].h;
	}
	Hash();
	for (int i = 1; i <= n; i++)
	{
		dp1[i] = 1;
		dp2[i] = 1;
		g1[i] = 1;
		g2[i] = 1;
	}
	build(1, n, 1);
	cdq1(1, n);
	cdq2(1, n);

	int mx = 0;
	for (int i = 1; i <= n; i++)
		mx = max(mx, dp1[i]);
	cout << mx << '\n';
	sort(a + 1, a + 1 + n, cmp2);
	double sum = 0;
	for (int i = 1; i <= n; i++)
	{
		if (dp1[i] == mx)
			sum += g1[i];
	}
	for (int i = 1; i <= n; i++)
	{
		if (dp1[i] + dp2[i] - 1 == mx)//满足这个条件则i在最长上升子序列中
			cout << fixed << setprecision(12) << g1[i] * g2[i] / sum << ' ';
		else
			cout << 0.0000000 << ' ';
	}
}

signed main()
{
	IOS;
	int t = 1;
	//cin >> t;
	while (t--)
		solve();
	return 0;
}