这题记忆化搜索
别看dfs有这么多代码,其实只要写出一种情况,其它三种全可 复制粘贴
dp[i][j]表示 以第i行第j个白色三角形为顶点的三角形中 最大的三角形的高度
因为这道题目比较特殊,你知道了三角形的高度后
就可以计算他的面积
因为是个等差数列
令高度为h
面积就为 (1+2*h-1)*h/2
(等差数列求和公式)
#include<stdio.h>
#include<iostream>
#include<memory.h>
#include<string.h>
#include<string>
#include<algorithm>
using namespace std;
int pic[110][300];
int dp[110][300];
int n, ans;
int dfs(int row, int col) {
if (dp[row][col]) return dp[row][col];
int mini = 1000;
if (row % 2 != 0) {
if (col % 2 == 0) {
if (pic[row + 1][col - 1] == 3 || pic[row + 1][col] == 3 || pic[row + 1][col + 1] == 3) return dp[row][col] = 1;
if (pic[row + 1][col - 1] && pic[row + 1][col] && pic[row + 1][col + 1]) {
mini = min(mini, dfs(row + 1, col - 1));
mini = min(mini, dfs(row + 1, col + 1));
return dp[row][col] = 1 + mini;
}
} else {
if (pic[row - 1][col - 1] == 3 || pic[row - 1][col] == 3 || pic[row - 1][col + 1] == 3) return dp[row][col] = 1;
if (pic[row - 1][col - 1] && pic[row - 1][col] && pic[row - 1][col + 1]) {
mini = min(mini, dfs(row - 1, col - 1));
mini = min(mini, dfs(row - 1, col + 1));
return dp[row][col] = 1 + mini;
}
}
} else {
if (col % 2 != 0) {
if (pic[row + 1][col - 1] == 3 || pic[row + 1][col] == 3 || pic[row + 1][col + 1] == 3) return dp[row][col] = 1;
if (pic[row + 1][col - 1] && pic[row + 1][col] && pic[row + 1][col + 1]) {
mini = min(mini, dfs(row + 1, col - 1));
mini = min(mini, dfs(row + 1, col + 1));
return dp[row][col] = 1 + mini;
}
} else {
if (pic[row - 1][col - 1] == 3 || pic[row - 1][col] == 3 || pic[row - 1][col + 1] == 3) return dp[row][col] = 1;
if (pic[row - 1][col - 1] && pic[row - 1][col] && pic[row - 1][col + 1]) {
mini = min(mini, dfs(row - 1, col - 1));
mini = min(mini, dfs(row - 1, col + 1));
return dp[row][col] = 1 + mini;
}
}
}
return dp[row][col] = 1;
}
int solve() {
ans = 0;
memset(dp, 0, sizeof(dp));
for (int i = 1; i <= n; i++) {
for (int j = i; j < i + 2 * (n - i + 1) - 1; j++) {
if (pic[i][j]) {
ans = max(ans, dfs(i, j));
}
}
}
return ans;
}
int main() {
string str;
int len, height;
int coun=0;
while (scanf("%d", &n) && n) {
for(int i=0;i<110;i++){
for(int j=0;j<300;j++){
pic[i][j]=3;
}
}
for (int i = 1; i <= n; i++) {
cin >> str;
len = str.length();
for (int j = i; j < len + i; j++) {
if (str[j - i] == '#') {
pic[i][j] = 0;
} else {
pic[i][j] = 1;
}
}
}
height = solve();
printf("Triangle #%d\n",++coun);
printf("The largest triangle area is %d.\n\n",height*height);
}
}