【题目链接】
[CSP-J 2021] 小熊的果篮 - 洛谷
4089. 小熊的果篮 - AcWing题库
【算法代码】
#include <bits/stdc++.h>
using namespace std;
const int maxn=2e5+5;
int n,a[maxn],L[maxn],R[maxn];
vector<int> v;
int main() {
scanf("%d", &n);
a[0]=a[n+1]=-1;
R[0]=1,L[n+1]=n;
for(int i=1; i<=n; i++) {
scanf("%d",&a[i]);
if(a[i]!=a[i-1])
v.push_back(i);
L[i]=i-1,R[i]=i+1;
}
while(R[0]!=n+1) {
vector<int> t;
for(int i=0; i<v.size(); i++) {
printf("%d ",v[i]);
int x=L[v[i]],y=R[v[i]];
R[x]=y,L[y]=x;
if(a[v[i]]!=a[x] && a[v[i]]==a[y])
t.push_back(y);
}
printf("\n");
v=t;
}
return 0;
}
/*
in1:
12
1 1 0 0 1 1 1 0 1 1 0 0
out1:
1 3 5 8 9 11
2 4 6 12
7
10
in2:
20
1 1 1 1 0 0 0 1 1 1 0 0 1 0 1 1 0 0 0 0
out2:
1 5 8 11 13 14 15 17
2 6 9 12 16 18
3 7 10 19
4 20
*/
【参考文献】
https://blog.csdn.net/PTCCTP/article/details/121070227
https://blog.csdn.net/qq_23109971/article/details/121024436