关闭

[置顶] 我的个人网站上线啦!欢迎访问:www.riba2534.cn

目前还在开始阶段,没有什么内容,不过以后会慢慢更新的,欢迎访问哦!网址是:www.riba2534.cn...
阅读(700) 评论(3)

POJ2289 Jamie's Contact Groups(二分图多重匹配+二分)

Description Jamie is a very popular girl and has quite a lot of friends, so she always keeps a very long contact list in her cell phone. The contact list has become so long that it often takes...
阅读(15) 评论(0)

Codeforces Round #447 (Div. 2) B. Ralph And His Magic Field(数论,组合数学)

Description Ralph has a magic field which is divided into n × m blocks. That is to say, there are n rows and m columns on the field. Ralph can put an integer in each block. However, the magic f...
阅读(67) 评论(0)

Codeforces Round #447 (Div. 2) C. Marco and GCD Sequence(构造,思路)

Description In a dream Marco met an elderly man with a pair of black glasses. The man told him the key to immortality and then disappeared with the wind of time. When he woke up, he only r...
阅读(115) 评论(0)

2017ACM-ICPC亚洲区域赛北京站 F.Secret Poems(模拟)

描述 The Yongzheng Emperor (13 December 1678 – 8 October 1735), was the fifth emperor of the Qing dynasty of China. He was a very hard-working ruler. He cracked down on corruption and his reign w...
阅读(42) 评论(0)

HDU3488 Tour(二分图最小完备匹配,KM算法,转化思想)

Problem Description In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the...
阅读(72) 评论(0)

HDU2255 奔小康赚大钱(二分图的最大完备匹配,KM算法)

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

Codeforces Round #446 (Div. 2) B. Wrath(线段树,RMQ,区间最值)

Description Hands that shed innocent blood! There are n guilty people in a line, the i-th of them holds a claw with length Li. The bell rings and every person kills some of people in front...
阅读(48) 评论(0)

HDU2034 人见人爱A-B(C++STL--set_difference()的应用)

Problem Description 参加过上个月月赛的同学一定还记得其中的一个最简单的题目,就是{A}+{B},那个题目求的是两个集合的并集,今天我们这个A-B求的是两个集合的差,就是做集合的减法运算。(当然,大家都知道集合的定义,就是同一个集合中不会有两个相同的元素,这里还是提醒大家一下) 呵呵,很简单吧? Input 每组输入数据占1行,每行数据的开始是2个整数n(0<=n...
阅读(36) 评论(0)

HDU3829 Cat VS Dog(二分图最大独立集)

Problem Description The zoo have N cats and M dogs, today there are P children visiting the zoo, each child has a like-animal and a dislike-animal, if the child’s like-animal is a cat, then his...
阅读(34) 评论(0)

POJ2594 Treasure Exploration(二分图最小路径覆盖,传递闭包)

Description Have you ever read any book about treasure exploration? Have you ever see any film about treasure exploration? Have you ever explored treasure? If you never have such experiences, y...
阅读(40) 评论(0)

HDU1511 Air Raid(二分图,最小路径覆盖)

Problem Description Consider a town where all the streets are one-way and each street leads from one intersection to another. It is also known that starting from an intersection and walking thr...
阅读(43) 评论(0)

HDU1054 Strategic Game(二分图最小点集覆盖,König定理)

Problem Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following proble...
阅读(26) 评论(0)

POJ3020 Antenna Placement(二分图最小路径覆盖)

Description The Global Aerial Research Centre has been allotted the task of building the fifth generation of mobile phone nets in Sweden. The most striking reason why they got the job, is their...
阅读(47) 评论(0)

HDU4185 Oil Skimming(二分图匹配,匈牙利算法)

Problem Description 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 wa...
阅读(45) 评论(0)

HDU2819 Swap(二分图匹配匈牙利算法+记录路径)

Problem Description Given an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all the diagonal entries equal to 1? Input Th...
阅读(32) 评论(0)
544条 共37页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:727638次
    • 积分:6166
    • 等级:
    • 排名:第4458名
    • 原创:486篇
    • 转载:58篇
    • 译文:0篇
    • 评论:30条
    博客专栏
    欢迎来我的网站:www.riba2534.cn
    文章分类
    最新评论