题意：找出最多的形如“##”横着竖着都可以，明显的1X2矩形覆盖，直接按坐标和的奇偶来分为二分图。 #include<cstdio>#include<iostream>#include<algorithm>#include<cmath>#include<set>#include<map>#include<string>#include<cstring>#include<stac