求助，两个代码修一个就行，谢谢大神们！！！

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,ll;
struct node{
	int num,ans;
};
queue<node> a,b;
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		node t;
		t.num=i;
		cin>>t.ans;
		a.push(t);
	}
	bool uu=0;
	while(ll!=n){
		if(uu==0){
			int kk=-1;
			int u=a.size();
			for(int i=0;i<u;i++){
				node t=a.front();
				a.pop();
				if(t.ans!=kk){
					kk=t.ans;
					cout<<t.num<<" ";
					ll++;
				}
				else b.push(t);
			}
			cout<<endl;
			uu=1;
		}
		else {
			int kk=-1;
			int u=b.size();
			for(int i=0;i<u;i++){
				node t=b.front();
				b.pop();
				if(t.ans!=kk){
					kk=t.ans;
					cout<<t.num<<" ";
					ll++;
				}
				else a.push(t);
			}
			cout<<endl;
			uu=0;
		}
	}
	return 0;
}

第一个，用队列

#include<bits/stdc++.h>
#define int long long
using namespace std;
int n,longg;
struct node{
	int num,ans;
	bool o;
};
vector<node> a;
signed main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		node t;
		cin>>t.ans;
		t.num=i;
		t.o=0;
		a.push_back(t);
	}
	while(longg!=n){
		int kk=-1;
		for(int i=0;i<a.size();i++){
			if(a[i].o==0){
				if(a[i].ans!=kk){
					kk=a[i].ans;
					cout<<a[i].num<<' ';
					a[i].o=1;
					longg++;
				}
			}
		}
		cout<<"\n";
	}
	return 0;
}

第二个，动态数组