小熊的果篮
#include<iostream>
#include<list>
using namespace std;
int n;
struct node
{
int val;
int num;
};
list<node> List;
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
int x;scanf("%d",&x);
List.push_back(node{x,i});
}
while(!List.empty())
{
int prev=-1;
list<node>::iterator it=List.begin();
for(it=List.begin();it!=List.end();it++)
{
if(prev!=it->val)
{
printf("%d ",it->num);
List.erase(it);
}
prev=it->val;
}
cout<<endl;
}
return 0;
}
RE了?