BZOJ 1078([SCOI2008]斜堆-结论题)

模拟斜堆的操作，发现最后一个节点是从根往左一直走直到第一个没有右节点的节点（如果有左节点再向左走一步，那么倒推即可

#include<bits/stdc++.h> 
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,0x3f,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define MEMx(a,b) memset(a,b,sizeof(a));
#define INF (0x3f3f3f3f)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
inline int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 
#define MAXN (1010)
int lson[MAXN],rson[MAXN],fa[MAXN],root,n;
int ans[MAXN];
int main()
{
//  freopen("bzoj1078.in","r",stdin);
//  freopen(".out","w",stdout);
    MEMx(lson,-1);
    MEMx(rson,-1);

    n=read();
    For(i,n) {
        int p=read();
        if (p>=100) rson[p-100]=i,fa[i]=p-100;
        else lson[p]=i,fa[i]=p;
    }
    root=0;
    int cnt=n+1;
    while(cnt--) {
        bool flag=0;
        int p=root;
        while(rson[p]!=-1) p=lson[p];
        if (lson[p]!=-1) if ( lson[lson[p]]==-1 && rson[lson[p]]==-1) p=lson[p];
        ans[cnt]=p;
        if (p==root) {
            root=lson[p]; fa[root]=-1;
            flag=1;
        }
        else if (-1!=lson[p]) {
            fa[lson[p]]=fa[p];
            lson[fa[p]]=lson[p];
        } else  lson[fa[p]]=-1;

        if (!flag) {
            while(p^flag) {
                p=fa[p];
                swap(lson[p],rson[p]);
            }
        }
    }
    Rep(i,n+1) printf("%d ",ans[i]); puts("");
    return 0;
}