POJ 2599 A funny game#树形SG（DFS实现）

【POJ 2599 A funny game#树形SG（DFS实现）】的更多相关文章

POJ 2599 A funny game#树形SG（DFS实现）

http://poj.org/problem?id=2599 #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<vector> using namespace std; int n,k,pos; vector<]; ]; int dfs(int k) { ;i<g[k].size();i++) { int t=g[k][…

poj 3140 Contestants Division（树形dp? dfs计数+枚举）

本文出自 http://blog.csdn.net/shuangde800 -------------------------------------------------------------------------------------- 题目链接:poj-3140 题目给n个节点的带权树,删掉其中一边,就会变成两颗子树, 求删去某条边使得这这两颗子树的权值之差的绝对值最小. 思路直接dfs一次,计算所有子树的权值总和tot[i] 如果删掉一条边(v, fa),fa…

POJ 2425 A Chess Game#树形SG

http://poj.org/problem?id=2425 #include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; struct node { int to,next; }e[]; ],Ecou; ]; void add_edge(int u,int v) { e[Ecou].to=v; e[Ecou].next=head[…

poj 3710 Christmas Game【博弈论+SG】

也就是转换到树形删边游戏,详见 https://wenku.baidu.com/view/25540742a8956bec0975e3a8.html #include<iostream> #include<cstdio> #include<cstring> using namespace std; const int N=1005; int T,n,m,cnt,h[N],w[N],s[N],top; bool v[N],ve[N]; struct qwe { int n…

HDU 5293 Annoying problem 树形dp dfs序树状数组 lca

Annoying problem 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5293 Description Coco has a tree, whose vertices are conveniently labeled by 1,2,-,n. There are m chain on the tree, Each chain has a certain weight. Coco would like to pick out some ch…

POJ 2023 Choose Your Own Adventure（树形，dfs，简单题）

题意: 输入一个整数n,表示有n组测试数据, 每组第一行输入一个整数x表示该组测试一共有x页,接下来输入x行,每行表示一页, 每页或者以C开头(第一页都是以C开头),或者以E开头,中间用引号括起一段文字. 以C开头的末尾输入两个数字a,b表示该页完后可以跳转到第a页或第b页, 以E开头的末尾输入一个单词,或者是HAPPY或者是GRISLY(有且仅有一页以HAPPY结尾). 现在要求你根据输入找出以第一页开头,以HAPPY结尾的路径,输出路径上每一页中间引号里面的内容,不包含引号. 思路:建立树,…

【POJ 2486】 Apple Tree (树形DP)

Apple Tree Description Wshxzt is a lovely girl. She likes apple very much. One day HX takes her to an apple tree. There are N nodes in the tree. Each node has an amount of apples. Wshxzt starts her happy trip at one node. She can eat up all the apple…