贪心，二叉树搜索，ZOJ(2315)

题目链接：http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=1315

解题报告：

#include <stdio.h>
#include <string.h>

struct Point
{
    int pr;
    int vis;
} points[+];

int ans[+];
int n;

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);

        int sum=;
        memset(points,,sizeof(points));

        for(int i=; i<=n; i++)
            scanf("%d",&points[i].pr);

        for(int i=n; i>; i--) ///从下往上扫
        {
            if(points[i].vis==&&points[points[i].pr].vis==)
            {
                points[i].vis=;
                points[points[i].pr].vis=;
                ans[sum++]=i;
            }
        }

        printf("%d\n",sum*);

        for(int i=sum-; i>=; i--)
        {
            if(i==sum-) printf("%d",ans[i]);
            else printf(" %d",ans[i]);
        }
        puts("");
    }
    return ;
}