<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>最大独立集 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E6%9C%80%E5%A4%A7%E7%8B%AC%E7%AB%8B%E9%9B%86/</link><description>Recent content in 最大独立集 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Sat, 28 May 2016 01:34:53 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E6%9C%80%E5%A4%A7%E7%8B%AC%E7%AB%8B%E9%9B%86/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 1068 Girls and Boys (二分图的最大独立集，匈牙利算法)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-05-28-hdu1068/</link><pubDate>Sat, 28 May 2016 01:34:53 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-05-28-hdu1068/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1068" target="_blank" rel="noreferrer"&gt;hdu 1068题目链接&lt;/a&gt;
题意：有n个同学。。给出同学之间的 爱慕关系。。。选出一个集合使得集合中的人没有爱慕关系。问能选出的最大集合是多少。&lt;/p&gt;</description></item></channel></rss>