wow that's sound great : )

but mine's still got TL - -'
i don't know why(i already use heap)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX 30000
#define CON 2000000000
struct node { long info; struct node *next; };
typedef struct node *nodeptr;
long arr[MAX*2],num[MAX],deg[MAX],n;
long nheap;
FILE *fp,*fx;
nodeptr res[MAX];
void input(void)
{
 long tmp;
 n=1;
 while(fscanf(fp,"%ld",&tmp)!=EOF)
   {
    num[n++]=tmp;
    deg[tmp]++;
   }
}
nodeptr getnode(long i,nodeptr next)
{
 nodeptr p;
  p=(nodeptr)malloc(sizeof(struct node));
  p->next=next; p->info=i;
 return p;
}
void add(long a,long b)
{
 nodeptr p,q;
 if( res[a]==NULL||b<res[a]->info)
  { res[a]=getnode(b,res[a]); return; }
 for(p=q=res[a];p!=NULL&&b>p->info;p=p->next) q=p;
 p=getnode(b,p); q->next=p;
}
void del(void)
{
 long pos,tmp,nextpos;
 arr[1]=CON;
 for(pos=1,tmp=arr[1];;)
  {
   if(arr[pos*2]<arr[pos*2+1]) nextpos=pos*2;
   else nextpos=pos*2+1;
   if(tmp>arr[nextpos])
     { arr[pos]=arr[nextpos]; pos=nextpos; }
   else break;
  }
 arr[pos]=tmp;
}
void insert(long a)
{
 long pos,k;
 for(k=10000;;k--) if(arr[k]==CON) break;
 nheap++;
 arr[k]=a;
 for(pos=k;pos>1;pos/=2)
  {
   if(a<arr[pos/2]) arr[pos]=arr[pos/2];
   else break;
  }
 arr[pos]=a;
}
void process(void)
{
 long i;
 for(i=0;i<MAX*2;i++) arr[i]=CON;
 for(i=1,nheap=0;i<=n;i++) if(!deg[i]) arr[++nheap]=i;
 for(i=1;i<n;i++)
   {
     add(arr[1],num[i]); add(num[i],arr[1]);
     del();
     deg[num[i]]--; if(!deg[num[i]]) insert(num[i]);
   }
}
void output(void)
{
 long i;
 nodeptr p;
 for(i=1;i<=n;i++)
  {
   fprintf(fx,"%ld:",i);
   for(p=res[i];p!=NULL;p=p->next) fprintf(fx," %ld",p->info);
   fprintf(fx,"\n");
  }
}
int main()
{
  fp=stdin; fx=stdout;
// fp=fopen("1069.in","r"); fx=fopen("1069.out","w");
  input();
  process();
  output();
// fclose(fp); fclose(fx);
 return 0;
}

/*
 *  ACM Online
 *  The Pruffer Code - Problem 1069
 */

#include <stdio.h>
#include <stdlib.h>

#define NODS 16000

long n, how[NODS], flag[NODS], sum[NODS], sol[NODS], s[NODS];


int main()
{
    long i, j, k, next, lev = 0;

    n = 0;
    while (scanf("%ld", &s[n++]) == 1)
        flag[--s[n - 1]]++;
    for (i = 0; i < n; i++)
        how[i] = flag[i] + 1;
    for (sum[0] = 0, i = 1; i <= n; i++)
        sum[i] = sum[i - 1] + how[i - 1], how[i - 1] = 0;

    for (i = 0; i < n; i++)
        if (!flag[i])
            next = i, i = n;
    for (i = 0; i < n - 1; i++)
    {
        k = s[i];
        sol[sum[k] + how[k]++] = next;
        sol[sum[next] + how[next]++] = k;
        flag[k]--; flag[next]--;
        while (flag[++next]);
        if (k < next && !flag[k]) next = k;
    }
    for (sum[0] = 0, i = 1; i <= n; i++)
        sum[i] = sum[i - 1] + how[i - 1];
    /* sortarea  */
    for (i = 0; i < n; i++)
        for (k = sum[i]; k < sum[i] + how[i]; k++)
            for (j = k + 1; j < sum[i] + how[i]; j++)
                if (sol[k] > sol[j])
                    next = sol[k], sol[k] = sol[j], sol[j] = next;

    for (i = 0; i < n; i++, printf("\n"))
    {
        printf("%ld: ", i + 1);
        for (k = sum[i]; k < sum[i] + how[i]; k++)
            printf("%ld ", sol[k] + 1);
    }
    return 0;
}

Please someone can post his AC because for 6 months i can't take AC
with a correct source (i'm sure of it...)