C++14(g++5.4) 解法, 执行用时: 6ms, 内存消耗: 376K, 提交时间: 2020-02-01 17:13:08

#include<stdio.h>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
int T,n,f[110],p[110],nowf,nowp;
int main(){
	scanf("%d",&T);
	while (T--){
		scanf("%d",&n);
		fo(i,1,n) scanf("%d",&f[i]);
		nowf=1;nowp=0;
		while (nowp<n){
			fd(i,n,1) if (f[i]==nowf) p[i]=++nowp;
			fo(i,1,n) if (f[i]==-1){
				f[i]=nowf;
				p[i]=++nowp;
				break;
			}else
				if (f[i]==nowf) break;
			nowf++;
		}
		fo(i,1,n-1) printf("%d ",p[i]);
		printf("%d\n",p[n]);
	}
	return 0;
}

C++11(clang++ 3.9) 解法, 执行用时: 10ms, 内存消耗: 608K, 提交时间: 2020-04-21 22:30:03

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int t1,n,i,j,l,cnt,now,a[500010],b[500010];
int main(){
	scanf("%d",&t1);
	while(t1--){
		scanf("%d",&n);
		for(i=1;i<=n;i++)scanf("%d",&a[i]);
		for(i=1;i<=n;i++)b[i]=0;
		l=1;now=1;cnt=0;
		while(1){
			while(b[l]>0)l++;
			//printf("%d\n",l);
			if(l>n)break;
			if(a[l]==-1)a[l]=now;
			for(i=n;i>=l;i--)if(a[i]==now)b[i]=++cnt;
			now++;
		}
		for(i=1;i<=n;i++)printf("%d ",b[i]);puts("");
	}
}