> #include <stdio.h>
> 
> typedef struct tagNode
> {
>     int nParent;
>     int nChildNum;
> }Node; 
> 
> void PrintNode(Node *pIndex, int nNodeNum, int nNode)
> {
>     int i = 0;
>     if(pIndex[nNode].nParent == 0) printf("(%d", nNode);
>     else printf(" (%d", nNode);
>     for(i = 1; i <= nNodeNum; i ++)
>         if(pIndex[i].nParent == nNode) PrintNode(pIndex, nNodeNum, i);
>     printf(")");
> }
> 
> void PrintTree(Node *pIndex, int nNodeNum)
> {
>     int i = 0, nRoot = 1;
>     for(i = 1; i <= nNodeNum; i++)
>     {
>         if(pIndex[i].nParent) continue;
>         nRoot = i;
>         break;
>     }
>     PrintNode(pIndex,nNodeNum, nRoot);
> }
> 
> int InitData(int *pData, char *strLine)
> {
>     int res = 0, i = 0,j = 0;
>     char strPart[4];
>     while(strLine[i] != '\0')
>     {
>         while(strLine[i] == ' ') i ++;
>         j = 0;
>         while(strLine[i] >= '0' && strLine[i] <= '9')
>             strPart[j++] = strLine[i++];
>         strPart[j] = '\0';
>         pData[res++] = atoi(strPart);
>     }
>     return res + 1;
> }
> 
> int main()
> {
>     Node pIndex[100];
>     int pData[100];
>     int nNodeNum, i, j;
>     int nMinLeaf, nMaxLeaf;
>     char strLine[2048];
>  
>     while(1)
>     {
>         if(NULL == gets(strLine) || strLine[0] == '\0') break;
>         for(i = 0; i < 100; i++)
>         {
>             pIndex[i].nParent = 0;
>             pIndex[i].nChildNum = 0;
>         }
>         nNodeNum = InitData(pData, strLine);
>         for(i = 0; i < nNodeNum-1; i++)
>             pIndex[pData[i]].nChildNum ++;
> 
>         for(i = 0; i < nNodeNum - 1; i ++)
>         {
>             nMinLeaf = 0x7FFFFFFF;
>             for(j = 1; j <= nNodeNum; j++)
>             {
>                 if(pIndex[j].nParent || pIndex[j].nChildNum > 0) continue;
>                 if(nMinLeaf > j) nMinLeaf = j;
>             }
>             pIndex[nMinLeaf].nParent = pData[i];
>             pIndex[pData[i]].nChildNum --;
>         }
>         PrintTree(pIndex, nNodeNum);
>         printf("\n");
>     }    
>     return 0;
> }    

• 不行的啊，那个是没有确定根节点的树，Sample中的就不一致。 (0) huicpc16 2005-08-15 23:12:22
  • 题目就这么说的 (0) frkstyc 2005-08-15 23:16:40
    • 键盘出毛病了,打不出数字来...郁闷 (0) xfxyjwf 2005-08-15 23:22:22
      • 1234567890 (0) frkstyc 2005-08-15 23:24:43
        • 说不定用那个号就打出来了 (0) frkstyc 2005-08-15 23:25:35
    • 不好处理。很明显，在2568中， 5 2 5 2 6 2 8 -> (8 (2 (3) (5 (1) (4)) (6 (7))))，而2567中，(2 (6 (7)) (3) (5 (1) (4)) (8)) -> 5 2 5 2 6 2 8 (0) huicpc16 2005-08-16 00:37:08
      • 反正有spj，管它么多 (0) frkstyc 2005-08-16 00:40:54