F. Greedy Sequence(The Preliminary Contest for ICPC Asia Nanjing 2019)

原题

You’re given a permutation a of length n ($1\le n\le 10^5$). For each $i\in [1,n]$, construct a sequence $s_i$​ by the following rules:
1.$s_i[1]=i$
2.The length of $s_i$ is n, and for each $j\in [2,n],s_i[j]\le s_i[j-1]$;
3.First, we must choose all the possible elements of $s_i$​ from permutation a. If the index of $s_i[j]$ in permutation a is $pos[j]$, for each $j\ge 2$, $|pos[j]-pos[j-1]|\le k$($1\le k\le 10^5$). And for each $s_i$​, every element of $s_i$ must occur in a at most once.
4.After we choose all possible elements for $s_i$​, if the length of $s_i$​ is smaller than nnn, the value of every undetermined element of $s_i$​ is 0;
5.For each $s_i$​, we must make its weight high enough.
Consider two sequences C=[c1,c2,…cn] and $D=[d_1,d_2,...,d_n]$, we say the weight of C is higher than that of D if and only if there exists an integer k such that $1\le k\le n$, $c_i=d_i$​ for all $1\le i<k$, and $c_k>d_k$​.

If for each $i\in [1,n]$, $c_i=d_i$, the weight of C is equal to the weight of D.

For each $i\in [1,n]$, print the number of non-zero elements of $s_i$​ separated by a space.
It’s guaranteed that there is only one possible answer.

Input:
There are multiple test cases.
The first line contains one integer $T(1\le T\le 20)$, denoting the number of test cases.
Each test case contains two lines, the first line contains two integers n and k ($1\le n,k\le 10^5$), the second line contains nnn distinct integers $a_1,a_2,...,a_n$($1\le a_i\le n$) separated by a space, which is the permutation a.

Output：
For each test case, print one line consists of n integers $|s_1|,|s_2|,...,|s_n|$ separated by a space.$|s_i|$ is the number of non-zero elements of sequence $s_i$​.There is no space at the end of the line.

思路

分析知$|s_i|$与$i$在$a_i$周围的k个元素中$\le a_i$的元素的最大一个有关，利用set lower_bound二分查找(STL 中的set使用红黑树实现，插入、查询、删除的时间复杂度为$\mathcal{O}(logn)$

代码实现

#include<bits/stdc++.h>
using namespace std;
const int MAX=1e5+3;
int t,n,k;
int a[MAX];
int pre[MAX],res[MAX];
int main(){
	scanf("%d",&t);
	while(t--){
		scanf("%d%d",&n,&k);
		set<int> s;
		for(int i=0;i<n;i++){
			scanf("%d",&a[i]);
		}
		int L=0, R=min(k, n);
		for(int i=L;i<=R;i++){
			s.insert(a[i]);
		}
		for(int i=0;i<n;i++){
			if(L<i-k)s.erase(a[L++]);
			if(R>=i+k)s.insert(a[++R]);
			set<int>::iterator it=s.lower_bound(a[i]);
			if(it==s.begin())pre[a[i]]=0;
			else pre[a[i]]=*(--it);
		}
		res[0]=0;
		for(int i=1;i<=n;i++){
			res[i]=res[pre[i]]+1;
		}
		for(int i=1;i<=n;i++){
			printf("%d",res[i]);
		}
		printf("\n");
	}
}	

参考链接：
https://blog.csdn.net/weixin_43667611/article/details/100527679
https://blog.csdn.net/qq_41157137/article/details/100185548