[NOIpPJ2018]对称二叉树——[搜索]

【题意分析】

稍微画下图就知道：对称二叉树的一个节点，左儿子的右儿子和右儿子的左二子一样

那岂不是一个dfs就解决了

Code：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <algorithm>
#define MAXN 1000010
using namespace std;

int a[MAXN], l[MAXN], r[MAXN], n, ans;

inline int read () {
	register int s = 0, w = 1;
	register char ch = getchar ();
	while (! isdigit (ch)) {if (ch == '-') w = -1; ch = getchar ();}
	while (isdigit (ch)) {s = (s << 3) + (s << 1) + (ch ^ 48); ch = getchar ();}
	return s * w;
}

bool check (int now, int Now) {
	if (now == -1 && Now == -1) return 1;
	if (now == -1 || Now == -1) return 0;
	if (a[now] != a[Now]) return 0;
	return check (l[now], r[Now]) & check (r[now], l[Now]);
}

int count (int now) {
	if (now == -1) return 0;
	return count (l[now]) + count (r[now]) + 1;
}

int main () {
	n = read ();
	for (register int i = 1; i <= n; i++) a[i] = read ();
	for (register int i = 1; i <= n; i++) l[i] = read (), r[i] = read ();
	for (register int i = 1; i <= n; i++)
		if (check (i, i)) ans = max (ans, count (i));
	return printf ("%d\n", ans), 0;
}