老程序员111 - 博客园

摘要： Problem Description In this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V, E). In m... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(12) 评论(0) 推荐(0)

摘要：【概述】在 DAG 的覆盖与独立集问题中，常见的问题分为三类：最小路径点覆盖最小路径可重复点覆盖最大独立集数这三类问题都可以利用二分图的匈牙利算法来解决。【最小路径覆盖】最小路径覆盖：给定一张有向无环图，要求用尽量少的不相交的简单路径，覆盖有向无环图的... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(268) 评论(0) 推荐(0)

摘要： Problem Description Roundgod is a famous milk tea lover at Nanjing University second to none. This year, he plans to conduct a ... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(25) 评论(0) 推荐(0)

摘要： Problem Description Considering the overall difficulty of other problems, we invite Quailty to propose an easy problem for this... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(20) 评论(0) 推荐(0)

摘要： Problem Description Acesrc is a famous mathematician at Nanjing University second to none. Playing with interesting numbers is ... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(27) 评论(0) 推荐(0)

摘要： Problem Description When Cuber QQ was chatting happily in a QQ group one day, he accidentally noticed that there was a counterf... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(19) 评论(0) 推荐(0)

摘要： Problem Description "Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching ... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(0) 评论(0) 推荐(0)

摘要： Problem Description "Good man never makes girls wait or breaks an appointment!" said the mandarin duck father. Softly touching ... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(0) 评论(0) 推荐(0)

摘要：题目描述墨墨购买了一套N支彩色画笔（其中有些颜色可能相同），摆成一排，你需要回答墨墨的提问。墨墨会向你发布如下指令： 1、 Q L R代表询问你从第L支画笔到第R支画笔中共有几种不同颜色的画笔。 2、 R P Col 把第P支画笔替换为颜色Col。... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(34) 评论(0) 推荐(0)

摘要：【题目描述】有n个人，编号为1,2,……n，另外还知道存在K个关系。一个关.系的表达为二元组（α，β）形式，表示α，β为同一家庭的成员。当n，k和k个关系给出之后，求出其中共有多少个家庭、最大的家庭中有多少人？例如：n＝6，k＝3，三个关系为（... 阅读全文

posted @ 2022-09-20 22:50 老程序员111 阅读(127) 评论(0) 推荐(0)

bianchengmao