1101. Quick Sort (25)

1101. Quick Sort (25)

#include 
#include 
#define N 100000+10
#define Min -1
#define Max 1000000000+10
int comp(const void*a,const void*b)
{
    return (*(int*)a)-(*(int*)b);
}
int main()
{
    int n,a[N],i,left[N],right[N];
    int lmax=Min,rmin=Max;
    scanf("%d",&n);
    for(i=0;iscanf("%d",&a[i]);
        lmax=(lmax>a[i])?lmax:a[i];
        left[i]=lmax;
    }
    for(i=n-1;i>=0;--i)
    {
        rmin=(rminint ans[N],size=0;
    for(i=0;iif(left[i]==right[i])
            ans[size++]=left[i];
    qsort(ans,size,sizeof(int),comp);
    printf("%d\n",size);
    for(i=0;iprintf("%d",ans[i]);
        if(i!=size-1)printf(" ");
    }
    printf("\n");
    return 0;
}