# Codeforces 876 E. National Property （2-SAT）

Description You all know that the Library of Bookland is the largest library in the world. There are dozens of thousands of books in the library. ...

# HDU 5988 Coding Contest （最小费用流）

Description A coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks, and there ...

# 51nod 1693 水群 （spfa）

Description 总所周知，水群是一件很浪费时间的事，但是其实在水群这件事中，也可以找到一些有意思的东西。 比如现在，bx2k就在研究怎样水表情的问题。 首先，bx2k在对话框中输入了一个表情��，接下来，他可以进行三种操作。 第一种，是全选复制，把所有表情...

# POJ 2186 Popular Cows （缩点）

Description Every cow’s dream is to become the most popular cow in the herd. In a herd of N (1 <= N <= 10,000) cows, you are given up to M (1...

# POJ 3683 Priest John's Busiest Day （2-SAT）

Description John is the only priest in his town. September 1st is the John’s busiest day in a year because there is an old legend in the town that ...

# POJ 3207 Ikki's Story IV - Panda's Trick （2-SAT）

Description liympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many times, he is tir...

# HDU 1814 Peaceful Commission （2-SAT）

Description The Public Peace Commission should be legislated in Parliament of The Democratic Republic of Byteland according to The Very Important L...

# HDU 6214 Smallest Minimum Cut （最小割）

Description Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong t...

# POJ 3352 Road Construction （缩点）

Description It’s almost summer time, and that means that it’s almost summer construction time! This year, the good people who are in charge of the ...

# HDU 6152 Friend-Graph （最大团）

Description It is well known that small groups are not conducive of the development of a team. Therefore, there shouldn’t be any small groups in a ...

# HDU 6118 度度熊的交易计划 （最小费用最大流）

Description 度度熊参与了喵哈哈村的商业大会，但是这次商业大会遇到了一个难题： 喵哈哈村以及周围的村庄可以看做是一共由n个片区，m条公路组成的地区。 由于生产能力的区别，第i个片区能够花费a[i]元生产1个商品，但是最多生产b[i]个。 同样的，由于每个...

# HDU 6041 I Curse Myself （仙人掌图）

Description There is a connected undirected graph with weights on its edges. It is guaranteed that each edge appears in at most one simple cycle. ...

# HDU 3594 Cactus （仙人掌图、Tarjan）

Description It is a Strongly Connected graph. Each edge of the graph belongs to a circle and only belongs to one circle. We call this ...

# POJ 1679 The Unique MST （次小生成树）

Description Given a connected undirected graph, tell if its minimum spanning tree is unique. Definition 1 (Spanning Tree): Consider a connect...

# POJ 2400 Supervisor, Supervisee （二分图最大权匹配）

Description Suppose some supervisors each get to hire a new person for their department. There are N people to be placed in these N departments. Ea...

# HDU 2255 奔小康赚大钱 （二分图最大权匹配）

Problem Description 传说在遥远的地方有一个非常富裕的村落,有一天,村长决定进行制度改革：重新分配房子。 这可是一件大事,关系到人民的住房问题啊。村里共有n间房间,刚好有n家老百姓,考虑到每家都要有房住（如果有老百姓没房子住的话，容易引起不安定因素），每家必须分配到...

# 山东省第七届 ACM 省赛 Proxy （最短路）

Problem Description Because of the GFW (Great Firewall), we cannot directly visit many websites, such as Facebook, Twitter, YouTube, etc. But with ...

# POJ 3308 Paratroopers （最小割）

Description It is year 2500 A.D. and there is a terrible war between the forces of the Earth and the Mars. Recently, the commanders of the Earth ar...

个人资料
等级：
访问量： 36万+
积分： 1万+
排名： 2019
欢迎关注 <千与梦随> 哦！
博客专栏
 那些年,我们一起追过的算法 文章：6篇 阅读：23920
最新评论