Codeforces Round #738 (Div. 2)

C. Mocha and Hiking

别忽略了n+1这个点

#include<iostream>
#include<cstdio>
#include<string>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
#include<vector>
using namespace std;
#define ll long long
#define lowbit(x) x&-x
#define N 1000005
//typedef __int128 ll;
typedef pair<int,int>pll;
const int mod=1e9+7;
double pi=acos(-1.0);
int a[10010];
signed main()
{
	int T; cin>>T;
	while(T--){
		ll n; cin>>n;
		for(ll i=1;i<=n;i++) cin>>a[i];
		if(a[1]==1){
			cout<<n+1<<" "; 
			for(ll i=1;i<=n;i++) cout<<i<<" ";
			cout<<endl;
		} 
		else if(a[n]==0){
			for(ll i=1;i<=n+1;i++) cout<<i<<" ";
			cout<<endl;
		}
		else{
			ll l,r;
			for(ll i=1;i<=n;i++){
				if(a[i]==0&&a[i+1]==1){
					l=i,r=i+1;
					break;
				}
			}
			for(ll i=1;i<=l;i++) cout<<i<<" ";
			cout<<n+1<<" ";
			for(ll i=r;i<=n;i++) cout<<i<<" ";
			cout<<endl; 
		}
	}
}