ACM_二分匹配

hdu 3468(二分匹配）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3468 大牛思路： 用BFS找出每一个集合点到其它可达点的距离以及这个集合点到下一集合点的距离 枚举是否能从一个集合点K经过一个宝物点X到达下一个集合点(K+1).如果能的话,则path[K][X]=true;  如果发现有一个集合点不可达的话，则输出-1; 1 #inc
·2015-11-02 11:17

uestc SOUND OF DESTINY

邻接表版的DFS形式的二分匹配 增广路求最大匹配数   匈牙利算法的要点如下 从左边第 1 个顶点开始，挑选未匹配点进行搜索，寻找增广路。
·2015-11-02 11:42

hdu2063 过山车（最大二分匹配）

强烈推荐的匈牙利算法介绍：http://www.renfei.org/blog/bipartite-matching.html   1 #include "iostream" 2 #include "vector" 3 #include "memory.h" 4 using namespace std;
·2015-11-02 11:36

pku 1486 求出二分匹配图中的必须边

开始楞是没看懂意思，E文让我很纠结... 要判断一条边是否为二分图中必须边，方法如下： 1、先求出原图的任意最大匹配 2、对二分图某一边的所有点，删去其当前的匹配边。删的过程不是简单的将原图设为不连通，你还得将其相应的匹配值设为未匹配。 假如原图link[a]=b；  那我们删边的时候既要讲map[b][a]设为0.，同时也要讲link[a]设为-1。(举个例子而已，数据的写法自
·2015-11-02 09:03

hdu 1045 Fire Net (二分图匹配)

表示空地,可以放置blockhouse //同一条直线上只能有一个blockhouse，除非有wall隔开，问在给出的图中 //最多能放置多少个blockhouse //二分匹配，别人都说水题
·2015-11-02 09:55

最大二分匹配 ZQUOJ21474 && POJ1486 Sorting Slides

Description Professor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk
·2015-11-02 09:50

poj 2771 二分匹配 Guardian of Decency

http://poj.org/problem?id=2771 一个保守的老师带学生出去玩，他希望任何一人不能配成一对，问你K个人中他能带出去的最大人数   最大独立集= 顶点数（总人数） - 最大匹配数      因为最小点覆盖集==最大匹配数 最小点覆盖集： 假如选了一个点就相当于覆盖了以它为端点的所有边，你需要选择最少的点来
·2015-11-02 09:47

pku 1904 King's Quest tarjan求强连通分量

id=1904 很多人都说是二分匹配题目，可是我还没有接触他呢。悲剧啊。不过这道题要求强连通分量做。
·2015-11-01 14:49

hdu 2063 过山车 二分匹配（匈牙利算法）

匈牙利算法：它由匈牙利数学家Edmonds于1965年提出，因而得名。此算法的核心就是寻找增广路径，通过增广路径来求二分图最大匹配的一种算法。 通过这个图片来讲述一下。黑色代表A\B\C\D四只小狗，红色代表四种口味的骨头，每一条线表示的是小狗喜欢吃这个口味的骨头。 我们按照顺序给小狗们分配骨头，先给A分配，很明显a无人占用并且小A狗很喜欢，分配，博主最喜欢成人之美。(✿◡‿◡) 现在给小B
·2015-11-01 13:21

hdu 1281 棋盘游戏（二分匹配）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1281 棋盘游戏 Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2905  &n
·2015-11-01 13:20

二分匹配解决poj 1466

Description In the second year of the university somebody started a study on the romantic relations between the students. The relation "romantically involved" is defined between one girl an
·2015-11-01 13:19

Hdu 1045　二分匹配

题目链接 Fire Net Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6282    Accepted Submission(s): 3551
·2015-11-01 11:46

Hdu 1498　二分匹配

50 years, 50 colors Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1484    Accepted Submission(s): 7
·2015-11-01 11:42

[ACM_模拟] UVA 12504 Updating a Dictionary [字符串处理 字典增加、减少、改变问题]

      Updating a Dictionary  In this problem, a dictionary is collection of key-value pairs, where keys are lower-case letters, and values are non-negative integers. Given
·2015-11-01 10:30

[ACM_水题] UVA 12502 Three Families [2人干3人的活后分钱，水]

      Three Families  Three families share a garden. They usually clean the garden together at the end of each week, but last week, family C was on holiday, so family A sp
·2015-11-01 10:29

[ACM_模拟] UVA 12503 Robot Instructions [指令控制坐标轴上机器人移动 水]

      Robot Instructions  You have a robot standing on the origin of x axis. The robot will be given some instructions. Your task is to predict its position after executin
·2015-11-01 10:29

二分匹配的常用建图方法

这时可以通过行列来进行二分匹配；假如位置（1，1），（1，3），（2，2），（3，1） 则横坐标1 2 3，纵坐标 1 2 3间有一定的关系，最小点覆盖=最大匹配数；
·2015-10-31 19:53

hdu1507二分匹配

1 //hdu1507 挺不错的题 2 #include<stdio.h> 3 #include<string.h> 4 #define INF 99999999 5 struct node 6 { 7 int x; 8 int y; 9 }rem[23005]; 10 struct Node
·2015-10-31 19:51

一些二分匹配的题

/*poj1469简单的二分匹配*/ #include<stdio.h> #include<string.h> int map[1005][1005],vis[2000
·2015-10-31 19:47

二分匹配详解

               二分图大讲堂——彻底搞定最大匹配数（最小覆盖数）、最大独立数、最小路径覆盖、带权最优匹配     文本内容框架： §1图论点、边集和二分图的相关概念和性质 §2二分图最大匹配求解 匈牙利算法、Ho
·2015-10-31 17:35

URAL1721——二分匹配——Two Sides of the Same Coin

Side one Poll flew above the City. Bright street lights flashed by below. He was winding his way around needle-sharp spires of communication towers and wicker grid radiators of thermonuclear power
·2015-10-31 15:13

HDU2255——二分匹配——奔小康赚大钱

Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到一间房子且只能得到一间房子。 另一方面,村长和另外的村领导希望得到最大的效益,这样村里的机构才会有钱.由于老
·2015-10-31 15:57

hdu3468 最大流 + 最短路

看上去像搜索，其实可以用最大流来做，或者二分匹配也行。 题目大意：iSea和他的朋友一块去寻宝，地图上显示了很多的金币，图中有字母'A', 'B' ... 'Z', 'a', 'b' ...
·2015-10-31 15:17

HDU 3729 二分匹配 反向匹配

题意： 给定 n个学生 说的 自己 考试排名的 可能范围 确定最多几个人说真话 如果有多种答案，输出字典序最大的那种( 要求字典序最大，所以solve中从最大字典序开始匹配)   思路： 题目给定  点 映射到 数轴的区间 上， 问最多多少点可以成功映射到数轴上 很显然  点就是 x集  ， 整个数轴 就是 y集 ， 点对应的整个区间就是映射的
·2015-10-31 14:25

Hdu 2444 The Accomodation of Students

敲二分匹配时突然发现了一个小错误，明白了是这个导致了爆栈。然后回过头去改DFS实现的交叉
·2015-10-31 12:38

[ACM_数据结构] POJ2352 [树状数组稍微变形]

  Description Astronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars tha
·2015-10-31 11:37

[ACM_图论] ZOJ 3708 [Density of Power Network 线路密度，a->b=b->a去重]

    The vast power system is the most complicated man-made system and the greatest engineering innovation in the 20th century. The following diagram shows a typical 14 bus power system. In
·2015-10-31 11:36

[ACM_水题] ZOJ 3712 [Hard to Play 300 100 50 最大最小]

  MightyHorse is playing a music game called osu!.   After playing for several months, MightyHorse discovered the way of calculating score in osu!: 1. While p
·2015-10-31 11:36

[ACM_暴力][ACM_几何] ZOJ 1426 Counting Rectangles (水平竖直线段组成的矩形个数，暴力）

Description We are given a figure consisting of only horizontal and vertical line segments. Our goal is to count the number of all different rectangles formed by these segments. As an example, the n
·2015-10-31 11:36

[ACM_动态规划] UVA 12511 Virus [最长公共递增子序列 LCIS 动态规划]

      Virus  We have a log file, which is a sequence of recorded events. Naturally, the timestamps are strictly increasing. However, it is infected by a virus, so random
·2015-10-31 11:36

[ACM_动态规划] hdu 1176 免费馅饼 [变形数塔问题]

    Problem Description 都说天上不会掉馅饼，但有一天gameboy正走在回家的小径上，忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了，这馅饼别处都不掉，就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了，所以gameboy马上卸下身上的背包去接。但由于小径两侧都不能站人，所以他只能在小径上接。由于gameboy平时老
·2015-10-31 11:36

[ACM_模拟] ACM - Draw Something Cheat [n个长12的大写字母串，找出交集，按字母序输出]

  Description Have you played Draw Something? It's currently one of the hottest social drawing games on Apple iOS and Android Devices! In this game, you and your friend play in turn. You
·2015-10-31 11:36

[ACM_数学] LA 3708 Graveyard [墓地雕塑 圈上新加点 找规律]

  Description   Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of
·2015-10-31 11:36

[ACM_水题] UVA 11292 Dragon of Loowater [勇士斗恶龙 双数组排序 贪心]

    Once upon a time, in the Kingdom of Loowater, a minor nuisance turned into a major problem. The shores of Rellau Creek in central Loowater had always been a prime breeding ground for g
·2015-10-31 11:36

[ACM_模拟][ACM_数学] LA 2995 Image Is Everything [由6个视图计算立方体最大体积]

  Description   Your new company is building a robot that can hold small lightweight objects. The robot will have the intelligence to determine if an object is light enough to hold. It
·2015-10-31 11:36

[ACM_图论] The Perfect Stall 完美的牛栏（匈牙利算法、最大二分匹配）

描述 农夫约翰上个星期刚刚建好了他的新牛棚，他使用了最新的挤奶技术。不幸的是，由于工程问题，每个牛栏都不一样。第一个星期，农夫约翰随便地让奶牛们进入牛栏，但是问题很快地显露出来：每头奶牛都只愿意在她们喜欢的那些牛栏中产奶。上个星期，农夫约翰刚刚收集到了奶牛们的爱好的信息（每头奶牛喜欢在哪些牛栏产奶）。一个牛栏只能容纳一头奶牛，当然，一头奶牛只能在一个牛栏中产奶。 给出奶牛们的爱好的信息，计算最
·2015-10-31 11:35

[ACM_搜索] ZOJ 1103 || POJ 2415 Hike on a Graph (带条件移动3盘子到同一位置的最少步数 广搜）

Description "Hike on a Graph" is a game that is played on a board on which an undirected graph is drawn. The graph is complete and has all loops, i.e. for any two locations there is exactly
·2015-10-31 11:35

[ACM_图论] Fire Net （ZOJ 1002 带障碍棋盘布炮，互不攻击最大数量）

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 cas
·2015-10-31 11:35

[ACM_图论] Sorting Slides(挑选幻灯片，二分匹配，中等）

Description Professor Clumsey is going to give an important talk this afternoon. Unfortunately, he is not a very tidy person and has put all his transparencies on one big heap. Before giving the talk
·2015-10-31 11:35

[ACM_搜索] Triangles(POJ1471,简单搜索，注意细节)

Description It is always very nice to have little brothers or sisters. You can tease them, lock them in the bathroom or put red hot chili in their sandwiches. But there is also a time when all meanne
·2015-10-31 11:35

[ACM_动态规划] ZOJ 1425 Crossed Matchings(交叉最大匹配 动态规划）

Description There are two rows of positive integer numbers. We can draw one line segment between any two equal numbers, with values r, if one of them is located in the first row and the other one is
·2015-10-31 11:35

[ACM_搜索] POJ 1096 Space Station Shielding （搜索 + 洪泛算法Flood_Fill）

Description Roger Wilco is in charge of the design of a low orbiting space station for the planet Mars. To simplify construction, the station is made up of a series of Airtight Cubical Modules (ACM's
·2015-10-31 11:35

[ACM_几何] Transmitters (zoj 1041 ,可旋转半圆内的最多点)

Description In a wireless network with multiple transmitters sending on the same frequencies, it is often a requirement that signals don't overlap, or at least that they don't conflict. One way of a
·2015-10-31 11:35

[ACM_模拟] The Willy Memorial Program （poj 1073 ,联通水管注水模拟）

Description Willy the spider used to live in the chemistry laboratory of Dr. Petro. He used to wander about the lab pipes and sometimes inside empty ones. One night while he was in a pipe, he fell as
·2015-10-31 11:35

[ACM_其他] Square Ice (poj1099 规律）

Description Square Ice is a two-dimensional arrangement of water molecules H2O, with oxygen at the vertices of a square lattice and one hydrogen atom between each pair of adjacent oxygen atoms. The
·2015-10-31 11:35

[ACM_图论] Highways （变形说法的最小生成树）

 http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28972#problem/C  题目给出T种情况，每种情况有n个城镇，接下来每一行是第i个城镇到所有城镇的距离（其实就是个可达矩阵）。  求建设一条公路联通所有城镇并且要求最长的一段最小（其实就是最小生成树）！代码如下： #include<
·2015-10-31 11:34

[ACM_数学] Counting Solutions to an Integral Equation （x+2y+2z=n 组合种类）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=27938#problem/E 题目大意：Given, n, count the number of solutions to the equation x+2y+2z=n, where x,y,z,n are non negative inte
·2015-10-31 11:34

[ACM_几何] The Deadly Olympic Returns!!! （空间相对运动之最短距离）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28235#problem/B 题目大意： 有两个同时再空间中匀速运动的导弹，告诉一个时间以及各自的初始坐标和该时间时的坐标，求运动过程中的最短距离 解题思路：  求出相对初位置、相对速度，则答案就是原点到射线型轨迹的距离，注意是射线！！！  
·2015-10-31 11:34

[ACM_几何] F. 3D Triangles （三维三角行相交）

http://acm.hust.edu.cn/vjudge/contest/view.action?cid=28235#problem/A 题目大意：给出三维空间两个三角形三个顶点，判断二者是否有公共点，三角形顶点、边、内部算三角形的一部分。 解题思路：见模板   //**********************************************
·2015-10-31 11:34

[ACM_动态规划] 轮廓线动态规划——铺放骨牌(状态压缩1)

Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where he had to use his toilet paper to draw on
·2015-10-31 11:34
上一页 4 5 6 7 8 9 10 11 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他