田园园野的博客

男女匹配： 输入样例： 5 4 14        //n,m,k  男个数，女个数，可以配对的组合 1 1 1 2 2 3 3 2 4 2 4 3 4 4 5 4 5 2 5 3 3 3 2 4 1 3 2 1 输出样例： 4 //最大组合数 #include #include #include using namespace std; int n,m

图中顶点看成村庄，每条边看成一段公路，如果在一段公路旁建一所学校，两个村子的学生都可以去上学，问至少要建几个学校 最小边覆盖 = n-最大匹配（这里最大匹配要除以2，因为将每个村庄一分为二，二分图左边是这n个村庄，右边也是这n个村庄） #include #include int n,m,ans=0;//n个村庄,m条边 int visit[105]; int link[105]; in

Machine Schedule Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9013    Accepted Submission(s): 4525 Problem Description As we all

Matrix Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2234    Accepted Submission(s): 992 Problem Description Give you a matrix(

Air Raid Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5294    Accepted Submission(s): 3551 Problem Description Consider a town

Girls and Boys Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11595    Accepted Submission(s): 5438 Problem Description the seco