深搜题,对于每一个白色小三角形,搜索将其作为顶角的最大三角形面积。如果其顶角向上,则向下搜索;如果其顶角向下,则向上搜索。
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 105;
char mp[MAXN][2 * MAXN];
int n;
//判断第h行是否从left至right都是'-'
bool judge(int h, int left, int right)
{
if (right > 2 * n - h || left < h) //越界
return false;
for (int i = left; i <= right; i++)
{
if (mp[h][i] != '-')
return false;
}
return true;
}
//将第h行第l列的三角形作为顶角,向上搜索
int up(int h, int l)
{
int area = 0;
for (int i = h; i >= 1; i--)
{
if (judge(i, l - (h - i), l + (h - i)))
area += 2 * (h - i) + 1;
else
break;
}
return area;
}
//将第h行第l列的三角形作为顶角,向下搜索
int down(int h, int l)
{
int area = 0;
for (int i = h; i <= n; i++)
{
if (judge(i, l - (i - h), l + (i - h)))
area += 2 * (i - h) + 1;
else
break;
}
return area;
}
//深搜,搜索最大三角形面积
int DFS()
{
int maxArea = 0;
for (int i = 1; i <= n; i++)
{
for (int j = i; j <= 2 * n - i; j++)
{
if (mp[i][j] == '#')
continue;
if ((i + j) % 2 == 1) //顶角向上的三角形
maxArea = max(maxArea, down(i, j));
else //顶角向下的三角形
maxArea = max(maxArea, up(i, j));
}
}
return maxArea;
}
int main()
{
int Case = 1;
while (cin >> n)
{
if (n == 0)
break;
getchar(); //读取换行符
for (int i = 1; i <= n; i++)
{
gets(mp[i] + 1);
}
cout << "Triangle #" << Case++ << endl;
cout << "The largest triangle area is " << DFS() << "." << endl << endl;
}
return 0;
}
继续加油。