Alex_McAvoy的博客

【概述】 在 DAG 的覆盖与独立集问题中，常见的问题分为三类： 最小路径点覆盖 最小路径可重复点覆盖 最大独立集数 这三类问题都可以利用二分图的匈牙利算法来解决。 【最小路径覆盖】 最小路径覆盖：给定一张有向无环图，要求用尽量少的不相交的简单路径，覆盖有向无环图的所有顶点（每个顶点恰好被覆盖一次） 根据 Koning 定理的推广：DAG 最小路径覆盖 = DAG 顶点数 - 新二分...

Problem Description Harry and his friends buy a lot of presents now, but they immediately find they had bought too many presents, so they decide to distribute them to the magicians who need them. To...

Problem 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 r...

Problem Description Running a taxi station is not all that simple. Apart from the obvious demand for a centralised coordination of the cabs in order to pick up the customers calling to get a cab as ...

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 through ...

Problem Description Your company provides robots that can be used to pick up litter from fields after sporting events and concerts. Before robots are assigned to a job, an aerial photograph of the f...

Problem Description Do you remember the box of Matryoshka dolls last week? Adam just got another box of dolls from Matryona. This time, the dolls have different shapes and sizes: some are skinny, so...

Problem Description In this problem, we would like to talk about unreachable sets of a directed acyclic graph G = (V, E). In mathematics a directed acyclic graph (DAG) is a directed graph with no d...