![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
解题报告3
苏城yzw
这个作者很懒,什么都没留下…
展开
-
poj 3321 Apple Tree 树状数组
Description There is an apple tree outside of kaka's house. Every autumn, a lot of apples will grow in the tree. Kaka likes apple very much, so he has been carefully nurturing the big apple tree.原创 2014-07-28 10:34:35 · 541 阅读 · 0 评论 -
hdu poj 3216 Repairing Company floyd+最小路径覆盖
Description Lily runs a repairing company that services the Q blocks in the city. One day the company receives M repair tasks, the ith of which occurs in block pi, has a deadline ti on any repair原创 2014-07-30 20:49:34 · 503 阅读 · 0 评论 -
hdu 2167 Pebbles 状态压缩dp
Problem Description You're given an unlimited number of pebbles to distribute across an N x N game board (N drawn from [3, 15]), where each square on the board contains some positive point value betw原创 2014-08-06 06:53:41 · 501 阅读 · 0 评论 -
hdu 4771 状态压缩+bfs Stealing Harry Potter's Precious
Problem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go back to uncle Vernon's home. Bu原创 2014-08-05 21:49:39 · 454 阅读 · 0 评论 -
poj 1185 炮兵阵地 状态压缩+dp sum dp,s,Map
Description 司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成,地图的每一格可能是山地(用"H" 表示),也可能是平原(用"P"表示),如下图。在每一格平原地形上最多可以布置一支炮兵部队(山地上不能够部署炮兵部队);一支炮兵部队在地图上的攻击范围如图中黑色区域所示: 如果在地图中的灰色所标识的平原上部署一支炮兵部队,则图中的黑色的原创 2014-08-06 08:37:51 · 670 阅读 · 0 评论 -
hdu 1532 最大网络流 Drainage Ditches
Problem Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by water for awhile and takes quite a long tim原创 2014-07-31 11:58:01 · 377 阅读 · 0 评论 -
poj 2724 Purifying Machine 二分图最大匹配
Description Mike is the owner of a cheese factory. He has 2N cheeses and each cheese is given a binary number from 00...0 to 11...1. To keep his cheese free from viruses, he made himself a purifyin原创 2014-07-30 18:45:46 · 447 阅读 · 0 评论 -
hdu 3549 最大网络流 Flow Problem
Problem Description Network flow is a well-known difficult problem for ACMers. Given a graph, your task is to find out the maximum flow for the weighted directed graph. Input The first line of原创 2014-07-31 18:05:57 · 370 阅读 · 0 评论 -
poj 1459 Power Network 最大网络流 先要构建
Description A power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce原创 2014-07-31 21:29:27 · 398 阅读 · 0 评论 -
hdu 3311 tsp问题
我不想证明,以后记住就可以了,原创 2014-08-07 20:12:39 · 441 阅读 · 0 评论 -
hdu 1528 Card Game Cheater 二分图的经典应用
Problem Description Adam and Eve play a card game using a regular deck of 52 cards. The rules are simple. The players sit on opposite sides of a table, facing each other. Each player gets k cards fro原创 2014-07-29 17:24:17 · 510 阅读 · 0 评论 -
hdu 1151 Air Raid DaG 图的最小路径覆盖
用尽量少的不相交简单路径覆盖有向无环图(DAG)G的所有顶点,这就是DAG图的最小路径覆盖问题 DaG==n-最大erfenpip原创 2014-07-29 11:00:57 · 360 阅读 · 0 评论 -
poj 3281 Dining 最大网络流
Description Cows are such finicky eaters. Each cow has a preference for certain foods and drinks, and she will consume no others. Farmer John has cooked fabulous meals for his cows, but he forgot原创 2014-08-01 12:02:33 · 480 阅读 · 0 评论 -
hdu Cyclic Tour 1853 费用流
Problem Description There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two citi原创 2014-08-01 20:50:53 · 413 阅读 · 0 评论 -
poj 1149 PIGS 最大网络流
Description Mirko works on a pig farm that consists of M locked pig-houses and Mirko can't unlock any pighouse because he doesn't have the keys. Customers come to the farm one after another. Each o原创 2014-08-01 08:50:37 · 486 阅读 · 1 评论 -
hdu 1507 最大匹配 Uncle Tom's Inherited Land* 黑白块的思想,有效分成两部分
Problem Description Your old uncle Tom inherited a piece of land from his great-great-uncle. Originally, the property had been in the shape of a rectangle. A long time ago, however, his great-great-u原创 2014-07-30 09:28:51 · 571 阅读 · 0 评论 -
poj 2226 Muddy Fields 二分图的经典应用
Description Rain has pummeled the cows' field, a rectangular grid of R rows and C columns (1 <= R <= 50, 1 <= C <= 50). While good for the grass, the rain makes some patches of bare earth quite mud原创 2014-08-04 09:45:50 · 423 阅读 · 0 评论 -
hdu 1281 棋盘游戏 枚举+最大匹配
Problem Description 小希和Gardon在玩一个游戏:对一个N*M的棋盘,在格子里放尽量多的一些国际象棋里面的“车”,并且使得他们不能互相攻击,这当然很简单,但是Gardon限制了只有某些格子才可以放,小希还是很轻松的解决了这个问题(见下图)注意不能放车的地方不影响车的互相攻击。 所以现在Gardon想让小希来解决一个更难的问题,在保证尽量多的“车”的前提下,棋盘里有些格原创 2014-07-29 13:59:18 · 386 阅读 · 0 评论 -
hdu 1498 50 years, 50 colors 二分图最大匹配
把每一个颜色单独求最大匹配原创 2014-07-29 15:24:44 · 470 阅读 · 0 评论 -
hdu 225 奔小康赚大钱 Km 算法
Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革:重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住(如果有老百姓没房子住的话,容易引起不安定因素),每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老百原创 2014-07-29 07:18:08 · 389 阅读 · 0 评论 -
hdu 1150 最小覆盖点==最大二分匹配 Machine Schedule
Problem Description As we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the nature of原创 2014-07-29 10:03:31 · 301 阅读 · 0 评论 -
poj 2288 状态压缩dp Islands and Bridges
Description Given a map of islands and bridges that connect these islands, a Hamilton path, as we all know, is a path along the bridges such that it visits each island exactly once. On our map, the原创 2014-08-09 10:40:49 · 344 阅读 · 0 评论