【NOIP2018PJ正式賽】對稱二叉樹

暴力dfs便可。web #include<cstdio> #define N 1000010 using namespace std; int n,v[N],l[N],r[N],son[N],ans=0; inline int read() { int x=0,f=0; char c=getchar(); while (c<'0' || c>'9') f=(c=='-') ? 1:f,c=g

>>阅读原文<<