- 博客(16)
- 资源 (8)
- 收藏
- 关注
RSS订阅原创 Codeforces Round #426 (Div. 2)The Meaningless Game(思维+二分)
lastyona and her loyal dog Pushok are playing a meaningless game that is indeed very interesting.The game consists of multiple rounds. Its rules are very simple: in each round, a natural number k is chosen. Then, the one who says (or barks) it faster tha
2017-07-31 01:24:48
1100
原创 UVA - 11624 Fire!(广搜+优先队列)
Fire!Joe works in a maze. Unfortunately,portions of the maze have caught on fire, and the owner of the maze neglectedto create a fire escape plan. Help Joe escape the maze.Given Joe's location
2017-07-29 17:24:42
513
1
原创 HDU 1010 Tempter of the Bone(深搜+剪枝)
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 126795 Accepted Submission(s): 34190Problem DescriptionThe
2017-07-29 17:04:54
371
原创 POJ 1190 生日蛋糕(深搜+剪枝)
生日蛋糕Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 20096 Accepted: 7151Description7月17日是Mr.W的生日，ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕，每层都是一个圆柱体。 设从下往上数第i(1 Ri+
2017-07-29 16:32:25
382
2
原创 HDU 1495 非常可乐(BFS||数论)
非常可乐Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16087 Accepted Submission(s): 6493Problem Description大家一定觉的运动以后喝可乐是一件很惬意的事情，但是seeyou却不这么认...
2017-07-28 21:39:55
517
原创 二叉树前序、中序、后序遍历相互求法
什么叫前中后序遍历：前序遍历： 1.访问根节点 2.前序遍历左子树 3.前序遍历右子树 中序遍历： 1.中序遍历左子树 2.访问根节点 3.中序遍历右子树 后序遍历： 1.后序遍历左子树 2.后序遍历右子树 3.访问根节点之前看到了从另一个网站上写的例子，举的挺好的，直接拿来举出来吧。
2017-07-25 15:37:17
603
原创 Codeforces Round #425 (Div. 2) B. Petya and Exam（字符串处理）
B. Petya and Examtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIt's hard times now. Today Petya needs to
2017-07-25 10:28:44
879
原创 判断是不是一棵树
A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. There is exactly one node, called the root, to which no direct
2017-07-22 18:01:35
1337
原创 51NOD 1572 宝岛地图（dp+优先队列）
勇敢的水手们到达了一个小岛，在这个小岛上，曾经有海盗在这里埋下了一些宝藏。然而，我们的船快抛锚了，与此同时，船长发现藏宝图的一角被老鼠咬掉了一块。 藏宝图可以用一个n×m大小的矩形表示。矩形中的每一小块表示小岛中的一小块陆地（方块的边长为1米）。有一些方块表示的是海，这些块人是不能通过的。除了海不能走，其它的小方块都是可以行走的。在可行走区域里有一些小方块表示一些已知的地点。
2017-07-22 16:56:44
334
原创 HDU 6016 Count the Sheep（思维题）（Interesting）
Count the Sheep Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
2017-07-22 16:29:17
366
原创 UVA - 11987 Almost Union-Find (并查集可删除)(两种方法)
Almost Union-FindTime Limit: 1000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionProblem AAlmost Union-FindI hope y
2017-07-22 14:41:30
450
原创 CodeForces - 566D Restructuring Company(并查集记录区间边界)
D. Restructuring Companytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEven the most successful company c
2017-07-22 14:12:49
508
原创 hdu 3345 War Chess（广搜,用不用优先队列都可以）
War ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2929 Accepted Submission(s): 733Problem DescriptionWar chess is hh's
2017-07-21 11:44:54
415
原创 POj 3250 Bad Hair Day (思维+单调栈)
Bad Hair DayTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 19167Accepted: 6522DescriptionSome of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a bad hair day! Since each c
2017-07-18 12:50:14
454
1
转载 所有人能看懂的并查集入门讲解
并查集是我暑假从高手那里学到的一招，觉得真是太精妙的设计了。以前我无法解决的一类问题竟然可以用如此简单高效的方法搞定。不分享出来真是对不起party了。（party：我靠，关我嘛事啊？我跟你很熟么？）来看一个实例，杭电1232畅通工程首先在地图上给你若干个城镇，这些城镇都可以看作点，然后告诉你哪些对城镇之间是有道路直接相连的。最后要解决的是整幅图的连通性问题。比如随意给你两个点，让你判断它们是否连...
2017-07-18 11:53:38
780
原创 POJ 3253 Fence Repair(优先队列+思维贪心)(哈夫曼树算法)
Farmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needs N (1 ≤ N ≤ 20,000) planks of wood, each having some integer length Li (1 ≤ Li ...
2017-07-18 11:08:44
452
2018第九届蓝桥杯C/C++B组决赛真题
2018-05-28
2018省赛第九届蓝桥杯真题BC组下载
2018-04-01
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人