cf1701 D 贪心

题意：https://www.luogu.com.cn/problem/CF1701D

思路：首先对于一个位置上能放的点就是一段区间，所以也就是有ｎ段区间然后１到ｎ各放一个区间，我们直接从起点开始贪心，对于当前点我们一定要放在可放的区间中右端点距离最近的，那么用优先队列维护即可。

/*keep on going and never give up*/
#include<cstdio>
#include<iostream>
#include<queue>
#include<algorithm>
using namespace std;
#define int long long
typedef pair<int, int> pii;
#define lowbit(x) x&(-x)
#define endl '\n'
#define wk is zqx ta die
int a[500005];
struct node {
	int l, r, id;
	bool operator < (const node& a)const {
		return a.r < r;
	}
} q[500005];
int ans[500005];
bool cmp(node a, node b) {
	return a.l < b.l;
}
signed main() {
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin >> t;
	while (t--) {
		int n;
		cin >> n;
		for (int i = 1; i <= n; i++) {
			cin >> a[i];
		}
		for (int i = 1; i <= n; i++) {
			if (a[i] == 0)
				q[i] = {i + 1, n, i};
			else
				q[i] = {i / (a[i] + 1) + 1, i / a[i], i};
		}
		sort(q + 1, q + n + 1, cmp);
		priority_queue<node> p;
		for (int i = 1, j = 1; i <= n; i++) {
			while (q[j].l <= i && j <= n) {
				p.push(q[j]);
				j++;
			}
			node e = p.top();
			p.pop();
			ans[e.id] = i;
		}
		for (int i = 1; i <= n; i++) {
			cout << ans[i] << " ";
		}
		cout << endl;
	}
	return 0;
}