UVA112 Tree Summing

好吧，线性表的题先跳过了，大多是一些无脑但是复杂的模拟。

题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=43041#problem/J

题目大意：给出一棵树，问是否存在一条从根到叶子的路径，使得这条路径上的每个结点的值的和为给定的数n

解题思路：建树（输入比较复杂，需要用cin.putback，建议递归输入），爆搜（深搜广搜都行）

坑点：有谁告诉你结点的值为非负了？

代码如下：

#include <iostream>
#include <stdio.h>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <string>
#include <string.h>
#include <sstream>
#include <cctype>
#include <climits>
#include <set>
#include <map>
#include <queue>
#include <vector>
#include <iterator>
#include <algorithm>
#include <stack>
#include <functional>
/*int类型最大值INT_MAX，short最大值为SHORT_MAX
long long最大值为LONG_LONG_MAX*/
//cout << "OK" << endl;
#define _clr(x) memset(x,0,sizeof(x))
using namespace std;
const int INF = INT_MAX;
const double eps = 1e-8;
const double EULER = 0.577215664901532860;
const double PI = 3.1415926535897932384626;
const double E = 2.71828182845904523536028;
typedef long long LL;
stack<char> kh;
int n,cnt = 0;
struct Trinode
{
	int lef = -1;
	int rig = -1;
	int num = 0;
}tr[1000010];
int input()
{
	char ch;
	cin >> ch;
	cin >> ch;
	if(ch!=')') cin.putback(ch);
	else return -1;
	cin >> tr[cnt].num;
	int x = cnt;
	cnt++;
	//cout << x << endl;
	tr[x].lef = input();
	tr[x].rig = input();
	cin >> ch;
	return x;
}
bool dfs(int tot,int node)
{
	//cout << "node :" << node << "left:" << tr[node].lef << " right:" << tr[node].rig << " num: " << tr[node].num << endl;
	if(tr[node].lef == -1 && tr[node].rig == -1)
	{
		//cout << tot+node << endl;
		return(tot+tr[node].num) == n;
	}
	if(tr[node].lef != -1 && dfs(tr[node].num+tot,tr[node].lef))return 1;
	if(tr[node].rig != -1 && dfs(tr[node].num+tot,tr[node].rig))return 1;
	return 0;
}
int main()
{
    //freopen("sample.in", "r", stdin);
	//freopen("sample.out", "w", stdout);
	
	while(cin >> n)
	{
		cnt = 0;
		int root = input();
		if(root == -1)
		{
			cout << "no" << endl;
			continue;
		}
		if(dfs(0,0))
		cout << "yes" << endl;
		else cout << "no" << endl;
		//cout << root << endl;
		//cout << lef[4] << " " << rig[4] << endl;
	}
	//cout << n << endl;
	
    //fclose(stdin);
    //fclose(stdout); 
    return 0;
}