题目链接:http://dsalgo.openjudge.cn/retrieval/3/
AC代码
#include <cstdio>
int PREV[100001], TAG[100001];
char cmd0[2];
int cmd1, cmd2;
int treeFind(int n) {
if (PREV[PREV[n]] == PREV[n]) return PREV[n];
int f = treeFind(PREV[n]);
TAG
题目链接:http://dsalgo.openjudge.cn/retrieval/3/
#include <cstdio>
int PREV[100001], TAG[100001];
char cmd0[2];
int cmd1, cmd2;
int treeFind(int n) {
if (PREV[PREV[n]] == PREV[n]) return PREV[n];
int f = treeFind(PREV[n]);
TAG