uva 12166 递归建树

想了好久没想出来，看了大佬的代码恍然大悟，这递归写的惊为天人~

我只解释一点，当确定一个节点为基准时，设此节点深度为depth，权重为weight，如果这棵树平衡，那么树的总权值为weight<<depth，这是因为树是二叉树，一个节点为weight，若要平衡，则它的兄弟节点也为weight，因此它的父亲节点为2*weight，同理，此节点的叔父节点也为2*weight，此节点的祖父节点就为4*weight。

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <queue>
#include <iostream>
#include <map>
#define INF 0x3f3f3f3f
using namespace std;
string str;
map<long long int, int> leaf;
int maxn;

void tree(int depth, int left, int right)
{
	int mid;
	int flag = 0;
		int p = 0;
	if(str[left] == '[')
	{
		for(int i = left; i <= right; i++)
		{
			if(str[i] == '[')	p++;
			if(str[i] == ']')	p--;
			if(p == 1)
				flag = 1;
			if(p != 1)
				flag = 0;
			if(flag == 1 && str[i] == ',')
			{
				mid = i;
				break;
			}
		}
		tree(depth+1, left+1, mid-1);
		tree(depth+1, mid+1, right-1);
	}
	else
	{
		long long int u = 0;
		for(int i = left; i <= right; i++)
			u = u*10+str[i]-'0'; 
		long long int uu;
		uu = u << depth;
		leaf[uu] ++;
		maxn++;
	}
}
			
int main()
{
	//freopen("ztest.txt","r",stdin);
	int t;
	scanf("%d", &t);
	while(t--)
	{
		maxn = 0;
		int ans = 0;
		cin >> str;
		leaf.clear();
		tree(0, 0, str.size()-1);
		for(map<long long, int>::iterator it = leaf.begin(); it != leaf.end(); ++it)
			ans = max(ans, it->second);
		printf("%d\n", maxn-ans);
	}
	return 0;
}