RT

代码：

#include <stdio.h>
#include <stdbool.h>

int sum[100007][7];
char s[100007];

int main(){
	int t;
	scanf("%d", &t);
	for (int i = 1; i <= t; i++){
		int n;
		bool flag = true;
		scanf("%d", &n);
		scanf("%s", &s[1]);
		for (int j = 1; j <= n; j++){
			if (s[j] != '0'){
				flag = false;
				break;
			}
		}
		if (flag){
			for (int j = n; j >= 1; j--){
				printf("%d ", j);
			}
			printf("\n");
			continue;
		}
		int m = (n - 1) / 2;
		for (int j = 1; j <= n; j++){
			sum[j][0] = sum[j - 1][0] + (s[j] == '0' ? 1 : 0);
			sum[j][1] = sum[j - 1][1] + (s[j] == '1' ? 1 : 0);
		}
		for (int j = 1; j <= n; j++){
			if (sum[j - 1][0] + (sum[n][1] - sum[j][1]) == m){
				for (int k = 1; k < j; k++){
					if (s[k] == '1') printf("%d ", k);
				}
				for (int k = j + 1; k <= n; k++){
					if (s[k] == '0') printf("%d ", k);
				}
				printf("%d ", j);
				for (int k = 1; k < j; k++){
					if (s[k] == '0') printf("%d ", k);
				}
				for (int k = j + 1; k <= n; k++){
					if (s[k] == '1') printf("%d ", k);
				}
				printf("\n");
				break;
			}
		}
	}
	return 0;
}