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

题目链接：     http://acm.hdu.edu.cn/showproblem.php?pid=4185 第一次写自己的博客呢，有点小激动，不对的地方希望大家帮忙改进。吐舌头 题意:   题意很简单，构造出模型就是在一个N*N的矩阵中，求上下或左右相连的"#"的最大组数（两个为一组）。大一接触的题目还是太少，一开始以为是连通块问题很开心地翻开了紫书狂敲代码，结果不停WA，赛

Problem Description Thanks to a certain “green” resources company, there is a new profitable industry of oil skimming. There are large slicks of crude oil floating in the Gulf of Mexico just waiti