Lesroad

传送门：点我Problem DescriptionAs we all know, machine scheduling is a very classical problem in computer science and has been studied for a very long history. Scheduling problems differ widely in the

传送门：点我DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 <= N <= 500). The grid contains K asteroids (1 <= K <= 10,000), which

最大匹配：二分图中边集的数目最大的那个匹配；最小顶点覆盖：用最少的点，让每条边都至少和其中一个点关联；最小边覆盖：用尽量少的不相交简单路径覆盖有向无环图(DAG)G的所有顶点；最大独立集：实质是个点集，这个集合里的点无论怎样都两两相连不到一起，满足这个要求的点数最少的一个。1、二分图中最小点覆盖等于最大匹配数2、二分图中最小边覆盖=顶点数-最小点覆盖（最大匹配）3、二分图中

题目链接：打开此题目Problem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between

传送门：点我Problem DescriptionConsider 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

#include#include#include#include#includeusing namespace std;#define N 205bool vis[N];int match[N],n,color[N];vectorq[N];bool Color(int s){ int i; for(i=0; i<q[s].size(); i++) {

The Vampires and Lykans are fighting each other to death. The war has become so fierce that, none knows who will win. The humans want to know who will survive finally. But humans are afraid of going t

You work in a company which organizes marriages. Marriages are not that easy to be made, so, the job is quite hard for you.The job gets more difficult when people come here and give their bio-data w