- 博客(20)
- 收藏
- 关注
原创 HDU 5927 (最近公共祖先)(bfs+树)
Auxiliary SetTime Limit: 9000/4500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1966 Accepted Submission(s): 574Problem DescriptionGiven a roote
2017-10-31 17:20:12 258
原创 hdu 5929 Basic Data Structure (双端队列)
Basic Data StructureTime Limit: 7000/3500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 260 Accepted Submission(s): 62Problem DescriptionMr. Fr
2017-10-31 08:57:37 220
原创 hdu 3342 Legal or Not (判环问题)
Legal or NotProblem DescriptionACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many "holy cows" like HH,
2017-10-21 09:16:05 330
转载 最小生成树Prim算法理解
MST(Minimum Spanning Tree,最小生成树)问题有两种通用的解法,Prim算法就是其中之一,它是从点的方面考虑构建一颗MST,大致思想是:设图G顶点集合为U,首先任意选择图G中的一点作为起始点a,将该点加入集合V,再从集合U-V中找到另一点b使得点b到V中任意一点的权值最小,此时将b点也加入集合V;以此类推,现在的集合V={a,b},再从集合U-V中找到另一点c使得点c到V中任
2017-10-21 08:32:23 144
原创 HDU 1863畅通工程(最小生成树)(prim算法)
畅通工程Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 10637 Accepted Submission(s): 4240Problem Description省政府“畅通工程”的目标是使全省任何两个
2017-10-21 08:24:25 288
原创 HDU 2680 Choose the best route 最短路(Dijkstra算法)
Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Probl
2017-10-21 08:08:23 182
原创 HDU 1599(floyd)(求最小回路问题)
find the mincost routeProblem Description 杭州有N个景区,景区之间有一些双向的路来连接,现在8600想找一条旅游路线,这个路线从A点出发并且最后回到A点,假设经过的路线为V1,V2,….VK,V1,那么必须满足K>2,就是说至除了出发点以外至少要经过2个其他不同的景区,而且不能重复经过同一个景区。现在8600需要你帮他找一条这样的路线,并且花费
2017-10-21 07:58:01 1039
原创 51 Nod(1459 迷宫游戏)(dijkstra)
1459迷宫游戏基准时间限制:1 秒 空间限制:131072 KB 分值:0难度:基础题你来到一个迷宫前。该迷宫由若干个房间组成,每个房间都有一个得分,第一次进入这个房间,你就可以得到这个分数。还有若干双向道路连结这些房间,你沿着这些道路从一个房间走到另外一个房间需要一些时间。游戏规定了你的起点和终点房间,你首要目标是从起点尽快到达终点,在满足首要目标的前提下,使得
2017-10-21 07:46:01 266
转载 数据结构 —— 二叉树 前序、中序、后序、层次遍历及非递归实现 查找、统计个数、比较、求深度的递归实现
转发自 : http://blog.csdn.net/fansongy/article/details/6798278/一、基本概念每个结点最多有两棵子树,左子树和右子树,次序不可以颠倒。性质:1、非空二叉树的第n层上至多有2^(n-1)个元素。2、深度为h的二叉树至多有2^h-1个结点。满二叉树:所有终端都在同一层次,且非终端结点的度数
2017-10-19 19:49:25 207
原创 HDU2680 Choose the best route (最短路)(Dijkstra算法)
Choose the best route Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Probl
2017-10-16 15:28:55 209
原创 HDU 1385 Minimum Transport Cost(floyd)(记录路径)
Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8794 Accepted Submission(s): 2311Problem DescriptionT
2017-10-16 15:02:11 205
原创 POJ 2387Til the Cows Come Home(最短单源路径)(dijkstra)
Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 59684 Accepted: 20312DescriptionBessie is out in the field and wants to get back t
2017-10-12 19:33:16 183
原创 Codeforces Round #439 (Div. 2) A-C题解
A. The Artful Expedienttime limit per test 1 secondmemory limit per test 256 megabytesinput standard inputoutput standard outputRock... Paper!After Karen ha
2017-10-08 11:42:50 424
原创 ACM-ICPC国际大学生程序设计竞赛北京赛区(2017)网络赛 Minimum
题目9 : Minimum时间限制:1000ms单点时限:1000ms内存限制:256MB描述You are given a list of integers a0, a1, …, a2^k-1.You need to support two types of queries:1. Output Minx,y∈[l
2017-10-08 10:16:24 395
原创 HDU 4474(Yet Another Multiple Problem)(BFS+同余定理)
Yet Another Multiple ProblemTime Limit: 40000/20000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 6291 Accepted Submission(s): 1460Problem Descriptio
2017-10-08 09:06:20 285
原创 HDU 4435(charge-station)(BFS+最小花费)
charge-stationTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Font: Times New Roman | Verdana | Georgia
2017-10-07 15:36:58 319
原创 Codeforces Round #438 by Sberbank and Barcelona Bootcamp (Div. 1 + Div. 2 combined)
纪念一下自己第一场CfA. Bark to Unlocktime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAs technologie
2017-10-06 08:50:15 314
原创 2017 ACM-ICPC 亚洲区(西安赛区)网络赛 B Coin (概率计算)
传送门: https://nanti.jisuanke.com/t/17115Bob has a not even coin, every time he tosses the coin, the probability that the coin's front face up is \frac{q}{p}(\frac{q}{p} \le \frac{1}{
2017-10-05 13:59:02 287
原创 HDU 5514 (Frogs) (容斥原理)
FrogsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2920 Accepted Submission(s): 931Problem DescriptionThere are m stones
2017-10-05 13:17:23 291
原创 HDU 4465 (candy)(期望+log优化)
CandyTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2890 Accepted Submission(s): 1305Special JudgeProblem DescriptionLazyChi
2017-10-05 10:57:00 310
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人