- 博客(7)
- 资源 (3)
- 收藏
- 关注
RSS订阅原创 UVALive7462 ——Work problem（读题能力很重要）
题目链接：题目链接题目开头：Raymond is a big data analyst. He constructs a social network G from n persons numbered 1, 2, … , n. For two groups of persons G1 and G2 , he utilizes the following two rules to construc
2016-07-31 16:13:56
536
原创 poj1236——Network of Schools（强连通分量+缩点）
Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 15674 Accepted: 6213 DescriptionA number of schools are connected to a computer network. Agreements have bee
2016-07-30 15:53:07
654
原创 POJ 2553——The Bottom of a Graph（强连通分量）
The Bottom of a Graph Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 10222 Accepted: 4229 DescriptionWe will use the following (standard) definitions from graph theory. Let V
2016-07-30 15:42:43
520
原创 hdu5724——chess（博弈）（状态压缩dp+sg函数）
Problem Description： Alice and Bob are playing a special chess game on an n × 20 chessboard. There are several chesses on the chessboard. They can move one chess in one turn. If there are no other che
2016-07-28 20:33:59
400
原创 2016多校训练赛第4场第十题（hdu5773——The All-purpose Zero） （简单）
Question: ?? gets an sequence S with n intergers(0 < n <= 100000,0<= S[i] <= 1000000).?? has a magic so that he can change 0 to any interger(He does not need to change all 0 to the same interger).??
2016-07-28 20:15:53
357
原创 hdu 5750——Dertouzos（简单）
Problem Description A positive proper divisor is a positive divisor of a number nn, excluding nn itself. For example, 1, 2, and 3 are positive proper divisors of 6, but 6 itself is not.Peter has two p
2016-07-25 21:05:18
465
原创 Uva 7363 -- A rational Sequence（简单）
题目大意：有一个二叉树，根节点为（1，1）。对于每一个节点(p,q),其左节点为(p,p+q),右节点为(p+q,q),先给出一个节点形如(p,q),请问其在原树的顺序中是第几个(即对原树进行BFS后本节点的BFS编号)。题解：本题实际上就是一个二叉树的变种，对每一个读入的节点，我们都可以知道它的上一个节点，以此类推，可以知道其整个枝条。有由二叉树性质，每个节点o 的左右节点序号分别为o*2,o*
2016-07-25 20:32:56
533
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人