poj
文章平均质量分 79
h1021456873
这个作者很懒,什么都没留下…
展开
-
POJ - 1836 Alignment (最长上升子序列 O(nlogn))
解题思路:是POJ2533的扩展题。题意不难,令到原队列的最少士兵出列后,使得新队列任意一个士兵都能看到左边或者右边的无穷远处。就是使新队列呈三角形分布就对了。 但这里有一个陷阱,看了一些别人的解题报告说“任一士兵旁边不能存在等高的士兵”,然后又举了一个例子说注意35 5 5的情况,我没看他们的程序,不知道他们是不是把这些例子特殊处理了,但完全没必要原创 2017-04-21 00:10:46 · 574 阅读 · 0 评论 -
POJ2251-Dungeon Master (三维BFS)
You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is composed of unit cubes which may or may not be filled with rock. It takes one minute to move one unit north, south原创 2017-03-14 19:00:07 · 248 阅读 · 0 评论 -
POJ 3660 牛的排名 (Floyd 传递闭包)
题意: 有n头牛, 给你m对关系(a, b)表示牛a能打败牛b, 求在给出的这些关系下, 能确定多少牛的排名。思路:这题的难点就是,牛到达怎么样的状态,才能说他的排名是确定的。。。仔细想想就是比牛强的人 + 比牛弱的人 == n-1 (自己不要考虑进去)然后嘛解决此类办法是 传递闭包了!!!!分析:在这呢先说一下关系闭包: 关系闭包有三种: 自反闭包(原创 2017-03-23 19:11:49 · 355 阅读 · 0 评论 -
POJ 3278 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 pointN (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 10原创 2017-03-14 11:27:59 · 189 阅读 · 0 评论 -
poj 1125 Stockbroker Grapevine (Floyd)
题意:此题题意远比题目难首先,题目可能有多组测试数据,每个测试数据的第一行为经纪人数量N(当N=0时,输入数据结束),然后接下来N行描述第i(1Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disi原创 2017-04-09 10:11:34 · 263 阅读 · 0 评论 -
POJ 3259 虫洞 (BellMan-Ford)
While exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that i原创 2017-03-22 23:02:05 · 295 阅读 · 0 评论 -
POJ 1860 换汇币 (BellmanFord)
Several currency exchange points are working in our city. Let us suppose that each point specializes in two particular currencies and performs exchange operations only with these currencies. There can原创 2017-03-22 21:15:54 · 254 阅读 · 0 评论 -
POJ2488 【骑士游历】( dfs + 回溯 )
DescriptionBackground The knight is getting bored of seeing the same black and white squares again and again and has decided to make a journey around the world. Whenever a knight moves, it is原创 2017-04-07 20:17:58 · 983 阅读 · 0 评论 -
POJ - 3268 Silver Cow Party (最短路)
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way r原创 2017-03-19 20:47:06 · 214 阅读 · 0 评论 -
POJ 1797 Heavy Transportation (最短路)
Background Hugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu原创 2017-03-19 20:03:19 · 280 阅读 · 0 评论 -
POJ 2253 Frogger (Floyd)
Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sun原创 2017-03-19 16:37:15 · 233 阅读 · 0 评论 -
POJ 2387 Til the Cows Come Home (最短路)
Bessie 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 sleep, so she wants to get b原创 2017-03-19 15:34:27 · 273 阅读 · 0 评论 -
POJ 2236 Wireless Network(并查集)
DescriptionAn earthquake takes place in Southeast Asia. The ACM (Asia Cooperated Medical team) have set up a wireless network with the lap computers, but an unexpected aftershock attacked, all com原创 2016-11-07 21:05:31 · 254 阅读 · 0 评论 -
POJ 3268 Silver Cow Party (Dijkstra_来回)
DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirect原创 2016-11-05 20:28:41 · 282 阅读 · 0 评论 -
POJ 3278 爬格子 (bfs求最短路径)
题目大意,就是给出a和b点的横坐标,求到a,b的最小行动次数,其中每次行动只能是下面两种情况之一向左或向右移动一步,即横坐标加1或者减1横坐标变成原来的两倍对于题目给出的数据5 17 , 可以这样进行行动 5 -> 10 -> 9 -> 18 -> 17 所以只需要四步就可以到达bDescriptionFarmer John has been informed原创 2016-03-15 14:38:19 · 474 阅读 · 1 评论 -
POJ 1426 Find The Multiple (BFS + 同余定理)
题意:给出一个整数n,(1 解题思路:深深体会到,学搜索前要先去学一下动态规划,懂得状态是怎么一回事情, 这题也是首先拿到题目我们想到的肯定就是一个一个去枚举, 每一位是枚举1 还是 0, 那么问题来了,答案总共可能会有100位,那么怎么办呢大体思路不变, 我们首先要解决达到什么状态停止搜索,很明显那就是余数等于0, 那么我们可以从高位到底位一个一个枚举,同时配合同余定理,那么问题原创 2017-03-14 20:33:16 · 295 阅读 · 0 评论 -
POJ 3126 Prime Path (BFS)
大致题意:给定两个四位素数a b,要求把a变换到b变换的过程要保证 每次变换出来的数都是一个 四位素数,而且当前这步的变换所得的素数 与 前一步得到的素数 只能有一个位不同,而且每步得到的素数都不能重复。 求从a到b最少需要的变换次数。无法变换则输出Impossible解题思路:四个数拿来模拟一下就好了。。注意千位非零!!!!!!!#inclu原创 2017-03-14 21:11:08 · 304 阅读 · 0 评论 -
POJ - 3267 The Cow Lexicon 字符串匹配 (dp)
题意就是给出一个主串,和一本字典,问最少在主串删除多少字母,可以使其匹配到字典的单词序列。PS:是匹配单词序列,而不是一个单词此题居然能1Y,我很是欣喜 AC后,看了一下网上的解法,没有特别详细的,我提供一个。网上的讨论,有人说从后面往前面DP会快一些,我觉得没有道理吧。从前往后与从后往前,在DP最优值的递推上要相反,除此以外求remove值时对单词的扫描也原创 2017-04-20 20:14:02 · 335 阅读 · 0 评论 -
POJ2485 求最小生成树的最大边 (裸prim)
题意很简单,就是求最小生成树的最大边。继续Prim吧O(∩_∩)OThe island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the traffic is difficult in Flatopia. The Flatopian gover原创 2017-04-06 21:41:06 · 299 阅读 · 0 评论 -
POJ1789-Truck History (prim裸)
题意大概是这样的:用一个7位的string代表一个编号,两个编号之间的distance代表这两个编号之间不同字母的个数。一个编号只能由另一个编号“衍生”出来,代价是这两个编号之间相应的distance,现在要找出一个“衍生”方案,使得总代价最小,也就是distance之和最小。例如有如下4个编号:aaaaaaabaaaaaaabaaaaaaabaaaa原创 2017-04-06 21:31:23 · 287 阅读 · 0 评论 -
POJ - 1837 Balance 天平(二维01背包)
提示:动态规划,01背包初看此题第一个冲动就是穷举。。。。不过再细想肯定行不通= =O(20^20)等着超时吧。。。我也是看了前辈的意见才联想到01背包,用动态规划来解 题目大意:有一个天平,天平左右两边各有若干个钩子,总共有C个钩子,有G个钩码,求将钩码全部挂到钩子上使天平平衡的方法的总数。其中可以把天枰看做一个以x轴0点作为平衡点的横轴输原创 2017-04-19 17:58:40 · 711 阅读 · 0 评论 -
POJ - 1129 Channel Allocation (dfs,四色定理)
题目翻译:当一个广播电台在一个非常大的地区,广播站会用中继器来转播信号以使得每一个接收器都能接收到一个强烈的信号。然而,每个中继器必须慎重选择使用,使相邻的中继器不互相干扰。如果相邻的中继器使用不同的频道,那么就不会相互干扰。由于无线电频道是一有限的,一个给定的网络所需的中继频道数目应减至最低。编写一个程序,读取一个中继网络,然后求出需要的最低的不同频道数。题解:当一个点染原创 2017-04-18 21:22:58 · 352 阅读 · 0 评论 -
POJ 1416 Shredding Company (DFS)
题目翻译:公司现在要发明一种新的碎纸机,要求新的碎纸机能够把纸条上的数字切成最接近而不超过target值。比如,target的值是50,而纸条上的数字是12346,应该把数字切成四部分,分别是1、2、34、6。因为这样所得到的和43 (= 1 + 2 + 34 + 6) 是所有可能中最接近而不超过50的。(比如1, 23, 4, 和6 就不可以,因为它们的和不如43接近50,而12, 34,原创 2017-04-18 19:36:21 · 332 阅读 · 0 评论 -
POJ 2531 Network Saboteur(dfs+剪枝)
题意就是把节点分成A、B两组,节点间距C给了,要求解分组的方法,使得∑Cij (i∈A,j∈B)最大。#include#include#include#include#includeusing namespace std;const int inf = 0x3f3f3f3f;int edge[22][22],vis[22];int flag,n;void dfs(原创 2017-04-18 10:47:48 · 343 阅读 · 0 评论 -
POJ 1847 火车变轨道 (简单最短路)
题意:火车从一点开到另一点,轨道上有很多岔路口,每个路口都有好几个方向(火车能够选任意一个方向开),但是 默认的是 第一个指向的方向,所以如果要选择别的方向的话得 进行一次切换操作 ,给定一个起点一个终点 ,问最少进行几次 切换操作 能够 使 火车 完成这个历程 , 如果开不到,输出“-1”。貌似很简单啊,直接把与第一个相连的距离置为0,后面相连的置为1然后用最短路的方原创 2017-03-26 16:56:27 · 729 阅读 · 0 评论 -
POJ3159 最大差距(差分约束系统 ,Dijkstra+Heap)
班上有n个同学,现在有一些糖要分给他们,设第i个同学得到的糖为p[i],分糖必须满足条件:第i个同学要求第j个同学的糖不能超过自己k个,即p[j] - p[i] = 0。要求在满足这些条件的情况下,求出p[n] - p[1]的最大值。由p[j] - p[i] 在单源最短路径的算法中有一步是“若mindis[j] > mindis[i] + dis[i][j],则mindis[j] = mi原创 2017-03-26 11:02:20 · 623 阅读 · 0 评论 -
POJ 1511 Invitation Cards (spfa + 静态邻接表)
题目大意:给出n个点和n条有向边,求所有点到源点1的来回最短路之和(保证每个点都可以往返源点1)解题思路:这个数据范围太大,明显的不能用floyd,dijstra,bellman-ford这些算法,用spfa的话也不能用邻接矩阵存,因为点太多了,所以采用spfa的邻接表存储搞定稍微有点注意的地方是,来回之和只需要将所有的边反向再从1到所有点求最短路就是他们的最短回路,而且这个题的数据有原创 2017-03-25 19:45:10 · 321 阅读 · 0 评论 -
POJ - 1062 昂贵的聘礼 (Floyd)
年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水晶球,大祭司要他用金币来换,或者替他弄来其他的东西,原创 2017-03-25 15:50:20 · 422 阅读 · 0 评论 -
POJ - 2240 汇率 (Floyd)
题目大意:可以简单描述为知道从i到j的汇率,问能不能赚钱Arbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of the same currency. For example,原创 2017-03-25 15:07:57 · 215 阅读 · 0 评论 -
poj1190 神剪枝啊 生日蛋糕 (dfs)
7月17日是Mr.W的生日,ACM-THU为此要制作一个体积为Nπ的M层生日蛋糕,每层都是一个圆柱体。 设从下往上数第i(1 Ri+1且Hi > Hi+1。 由于要在蛋糕上抹奶油,为尽可能节约经费,我们希望蛋糕外表面(最下一层的下底面除外)的面积Q最小。 令Q = Sπ 请编程对给出的N和M,找出蛋糕的制作方案(适当的Ri和Hi的值),使S最小。 (除Q外,以上所有数据皆为正原创 2017-03-25 13:52:49 · 271 阅读 · 0 评论 -
POJ - 3279 Fliptile (暴力+二进制)
Farmer John knows that an intellectually satisfied cow is a happy cow who will give more milk. He has arranged a brainy activity for cows in which they manipulate anM × N grid (1 ≤ M ≤ 15; 1 ≤ N ≤ 1原创 2017-03-15 13:26:12 · 288 阅读 · 0 评论 -
POJ 1011 最小的木棒 (dfs+剪枝|| 搜索好题)
Description乔治拿来一组等长的木棒,将它们随机地砍断,使得每一节木棍的长度都不超过50个长度单位。然后他又想把这些木棍恢复到为裁截前的状态,但忘记了初始时有多少木棒以及木棒的初始长度。请你设计一个程序,帮助乔治计算木棒的可能最小长度。每一节木棍的长度都用大于零的整数表示。Input输入包含多组数据,每组数据包括两行。第一行是一个不超过64的整数,表示砍断之后共有多少节原创 2016-03-15 00:36:24 · 1603 阅读 · 1 评论 -
POJ 2828 排队插队(线段树_好题)
DescriptionRailway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…The Lunar New Year was approaching, but unluckily the Little Ca原创 2016-03-09 14:58:20 · 1652 阅读 · 1 评论 -
POJ 2385 Apple Catching (DP)
DescriptionIt is a little known fact that cows love apples. Farmer John has two apple trees (which are conveniently numbered 1 and 2) in his field, each full of apples. Bessie cannot reach the app原创 2015-08-01 12:14:06 · 480 阅读 · 0 评论 -
POJ 1088 滑雪 (递归+记忆化搜索)
DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜,而且当你滑到坡底,你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。下面是一个例子 1 2 3 4 516 17 18 19 615 24 25 20 714 2原创 2015-09-10 20:31:35 · 452 阅读 · 1 评论 -
POJ 1083 Moving Tables (水题)
DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. The floor has 200 rooms each on the north side and south原创 2015-09-10 18:49:36 · 343 阅读 · 1 评论 -
POJ 1018 Communication System(简单DP)
DescriptionWe have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several原创 2015-09-10 14:57:26 · 414 阅读 · 1 评论 -
POJ 3320 Jessica's Reading Problem (尺取法_滑动窗口,阅读最少页数)
DescriptionJessica's a very lovely girl wooed by lots of boys. Recently she has a problem. The final exam is coming, yet she has spent little time on it. If she wants to pass it, she has to master原创 2015-09-26 10:31:25 · 593 阅读 · 1 评论 -
POJ 1050 To the Max (最大连续区间和+暴力枚举,水题)
DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1*1 or greater located within the whole array. The sum of a rectangl原创 2015-09-10 17:20:02 · 613 阅读 · 1 评论 -
POJ 1300 Door Man(欧拉回路_格式控制*)
DescriptionYou are a butler in a large mansion. This mansion has so many rooms that they are merely referred to by number (room 0, 1, 2, 3, etc...). Your master is a particularly absent-minded lou原创 2015-08-19 13:57:42 · 565 阅读 · 0 评论