图论
CNG Steve·Curcy
death is what gives life meaning, to know your days are numbered,your time is short.
展开
-
HDU - 1517 - A Multiplication Game
Stan and Ollie play the game of multiplication by multiplying an integer p by one of the numbers 2 to 9. Stan always starts with p = 1, does his multiplication, then Ollie multiplies the number, then ...原创 2018-09-30 18:21:34 · 141 阅读 · 0 评论 -
HDU - 4185 - Oil Skimming(二分图最大分配)
Thanks to a certain “green” resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gulf of Mexico just waiting to be scooped up by e...原创 2018-10-17 09:36:48 · 172 阅读 · 0 评论 -
HDU - 1045 - Fire Net(dfs )
Suppose that we have a square city with straight streets. A map of a city is a square board with n rows and n columns, each representing a street or a piece of wall.A blockhouse is a small castle tha...原创 2018-10-17 11:29:42 · 131 阅读 · 0 评论 -
UVALive 3126 Taxi Cab Scheme(最大匹配问题)
Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordi-nation of the cabs in order to pick up the customers calling to get a cab as soon as possible, th...原创 2018-10-21 20:44:32 · 148 阅读 · 0 评论 -
POJ - 1410 - Intersection(计算几何)
You are to write a program that has to decide whether a given line segment intersects a given rectangle.An example:line: start point: (4,9)end point: (11,2)rectangle: left-top: (1,5)right-bottom...原创 2018-10-27 19:07:37 · 177 阅读 · 0 评论 -
hdu-2376 - Average distance(树形dp )
Given a tree, calculate the average distance between two vertices in the tree. For example, the average distance between two vertices in the following tree is (d 01 + d 02 + d 03 + d 04 + d 12 +d 13 +...原创 2018-11-14 10:28:04 · 159 阅读 · 0 评论 -
POJ - 1947 - Rebuilding Roads(树形dp )
The cows have reconstructed Farmer John’s farm, with its N barns (1 <= N <= 150, number 1…N) after the terrible earthquake last May. The cows didn’t have time to rebuild any extra roads, so now ...原创 2018-11-16 19:21:52 · 162 阅读 · 0 评论 -
最大流模板(一)BFS
Drainage Ditches 参考博客用这篇博客学习了一下bfs求解最大流,然后先做一下笔记。(以下均为笔者自己理解,有不对之处还望大佬指出)首先,我们学习最大流就要先了解什么是最大流。最大流问题定义:管道网络中每条边的最大通过能力(容量)是有限的,实际流量不超过容量。最大流问题(maximum flow problem),一种组合最优化问题,就是要讨论如何充分利用装置的能力,使得运输...原创 2018-11-27 13:35:13 · 489 阅读 · 0 评论 -
CodeForces - 340D - Bubble Sort Graph(最长非降子序列)
Iahub recently has learned Bubble Sort, an algorithm that is used to sort a permutation with n elements a1, a2, …, an in ascending order. He is bored of this so simple algorithm, so he invents his own...原创 2018-12-03 16:37:54 · 143 阅读 · 0 评论 -
Gym 101911A Coffee Break(优先队列)
Recently Monocarp got a job. His working day lasts exactly m minutes. During work, Monocarp wants to drink coffee at certain moments: there are n minutes a1,a2,…,an, when he is able and willing to ta...原创 2018-12-17 18:19:17 · 354 阅读 · 0 评论 -
CodeChef - CLIQUED Bear and Clique Distances(最短路)
Bearland consists of N cities, numbered 1 through N. Cities are connected with bidirectional roads.Cities 1 through K were built a long time ago, when citizens liked order and regularity. Each pair o...原创 2019-04-03 20:11:33 · 145 阅读 · 0 评论 -
HDU - 1527 - 取石子游戏(威佐夫博弈)
有两堆石子,数量任意,可以不同。游戏开始由两个人轮流取石子。游戏规定,每次有两种不同的取法,一是可以在任意的一堆中取走任意多的石子;二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目,如果轮到你先取,假设双方都采取最好的策略,问最后你是胜者还是败者。Input输入包含若干行,表示若干种石子的初始情况,其中每一行包含两个非负整数a和b,表示两堆石子的...原创 2018-09-30 16:24:00 · 157 阅读 · 0 评论 -
HDU - 3951 - Coin Game(nim博弈)
After hh has learned how to play Nim game, he begins to try another coin game which seems much easier.The game goes like this:Two players start the game with a circle of n coins.They take coins fr...原创 2018-09-26 10:43:26 · 193 阅读 · 0 评论 -
确定比赛名次(拓扑排序+优先队列)
确定比赛名次有N个比赛队(1<=N<=500),编号依次为1,2,3,。。。。,N进行比赛,比赛结束后,裁判委员会要将所有参赛队伍从前往后依次排名,但现在裁判委员会不能直接获得每个队的比赛成绩,只知道每场比赛的结果,即P1赢P2,用P1,P2表示,排名时P1在P2之前。现在请你编程序确定排名。 Input 输入有若干组,每组中的第一行为二个数N(1<=N<=500...原创 2018-07-30 18:32:37 · 280 阅读 · 0 评论 -
Roads in the North (裸的求树直径)
Roads in the NorthBuilding and maintaining roads among communities in the far North is an expensive business. With this in mind, the roads are build such that there is only one route from a village ...原创 2018-07-30 18:45:09 · 164 阅读 · 0 评论 -
HDU - 1535 - Invitation Cards (spfa & 双向遍历)
HDU - 1535 - Invitation CardsIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most ...原创 2018-08-04 10:49:31 · 223 阅读 · 0 评论 -
Til the Cows Come Home (求图中的最短路)
Til the Cows Come HomeBessie is out in the field and wants to get back to the barn to get as much sleep as possible before Farmer John wakes her for the morning milking. Bessie needs her beauty slee...原创 2018-07-31 13:42:02 · 164 阅读 · 0 评论 -
HDU Today(最短路问题)
HDU Today经过锦囊相助,海东集团终于度过了危机,从此,HDU的发展就一直顺风顺水,到了2050年,集团已经相当规模了,据说进入了钱江肉丝经济开发区500强。这时候,XHD夫妇也退居了二线,并在风景秀美的诸暨市浬浦镇陶姚村买了个房子,开始安度晚年了。 这样住了一段时间,徐总对当地的交通还是不太了解。有时很郁闷,想去一个地方又不知道应该乘什么公交车,在什么地方转车,在什么地方下车(其实...原创 2018-07-31 14:17:36 · 262 阅读 · 0 评论 -
HDU - 6290 - travel (原题目:奢侈的旅行)(最短路 & 条件判断)
HDU - 6290 - travel (原题目:奢侈的旅行)高玩小Q不仅喜欢玩寻宝游戏,还喜欢一款升级养成类游戏。在这个游戏的世界地图中一共有nn个城镇,编号依次为11到nn。 这些城镇之间有mm条单向道路,第ii 条单项道路包含四个参数ui,vi,ai,biui,vi,ai,bi,表示一条从uiui号城镇出发,在vivi号城镇结束的单向道路,因为是单向道路,这不意味着小Q可以从viv...原创 2018-08-05 12:19:31 · 430 阅读 · 0 评论 -
MPI Maelstrom(最短路,Dijkstra)
MPI MaelstromBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee’...原创 2018-08-01 09:39:18 · 137 阅读 · 0 评论 -
Caterpillar (图论 & 思维)
CaterpillarAn undirected graph is called a caterpillar if it is connected, has no cycles, and there is a path in the graph where every node is either on this path or a neighbor of a node on the path...原创 2018-08-03 11:21:36 · 1044 阅读 · 0 评论 -
基础算法_N皇后问题(回溯法 dfs)
DescriptionN后问题在N×N的棋盘上放置N个皇后而彼此不受攻击(即在棋盘的任一行、任一列和任一对角线上不能放置两个皇后),编程求解所有的摆放方法。Input 第一行为测试数据组数T接下来T行,每行一个整数n(1<=n<=10)Output 输出T行为每行为相应的方案数Sample Input 1 1 Sample Output 1这个题目...原创 2018-08-22 08:43:42 · 705 阅读 · 0 评论 -
POJ - 3278(or HDU 2717)Catch That Cow(BFS)
Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,0...原创 2018-08-28 08:25:48 · 147 阅读 · 0 评论 -
HDU - 1863 - 畅通工程(最小生成树)
题目链接 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通(但不一定有直接的公路相连,只要能间接通过公路可达即可)。经过调查评估,得到的统计表中列出了有可能建设公路的若干条道路的成本。现请你编写程序,计算出全省畅通需要的最低成本。 Input 测试输入包含若干测试用例。每个测试用例的第1行给出评估的道路条数 N、村庄数目M ( < 100 );随后的 N 行对应村...原创 2018-09-02 12:38:07 · 204 阅读 · 0 评论 -
HDU - 5883 -The Best Path (连通图&欧拉通路)
Alice is planning her travel route in a beautiful valley. In this valley, there are N lakes, and M rivers linking these lakes. Alice wants to start her trip from one lake, and enjoys the landscape by...原创 2019-07-07 08:45:27 · 136 阅读 · 0 评论