杭电——１４６７，求牛人解决
TrianglesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 116 Accepted Submission(s): 54
Problem Description
It is always very nice to have little brothers or sisters. You can tease them, lock them in the bathroom or put red hot chili in their sandwiches. But there is also a time when all meanness comes back!
As you know, in one month it is Christmas and this year you are honored to make the big star that will be stuck on the top of the Christmas tree. But when you get the triangle-patterned silver paper you realize that there are many holes in it. Your little sister has already cut out smaller triangles for the normal Christmas stars. Your only chance is to find an algorithm that tells you for each piece of silver paper the size of the largest remaining triangle.
Given a triangle structure with white and black fields inside you must find the largest triangle area of white fields, as shown in the following figure.
Input
The input contains several triangle descriptions. The first line of each description contains an integer n (1 <= n <= 100), which gives the height of the triangle. The next n lines contain characters of the set {space, #, -} representing the rows of the triangle, where `#' is a black and `-' a white field. The spaces are used only to keep the triangle shape in the input by padding at the left end of the lines. (Compare with the sample input. The first test case corresponds to the figure.)
For each triangle, the number of the characters `#' and `-' per line is odd and decreases from 2n - 1 down to 1.
The input is terminated by a description starting with n = 0.
Output
For each triangle in the input, first output the number of the triangle, as shown in the sample output. Then print the line ``The largest triangle area is a.'', where a is the number of fields inside the largest triangle that consists only of white fields. Note that the largest triangle can have its point at the top, as in the second case of the sample input.
Output a blank line after each test case.
Sample Input
5
#-##----#
-----#-
---#-
-#-
-
4
#-#-#--
#---#
##-
-
0
我的代码：就是不过，不知道为什么，求牛人解决；
#include<iostream>
using namespace std;
#define T 120
int R;
char map[T][2*T+2];
int max_s,num[T][2*T+2];
int min(int i,int j,int k)
{
i=i>j?j:i;
return i>k?k:i;
}
int main()
{
int i,j,c=0;
while(scanf("%d",&R),R)
{
max_s=0;
if(c!=0)printf("\n");
for(i=1;i<=R;i++)
scanf("%s",map[i]);
memset(num,0,sizeof(num));
for(i=1;i<=R;i++)
{
for(j=0;j<=2*R-2*i;j++)
{
if(map[i][j]=='-')
{
if(map[i-1][j]=='-' && map[i-1][j+1]=='-'&& map[i-1][j+2]=='-')
num[i][j]=min(num[i-1][j],num[i-1][j+1],num[i-1][j+2])+1;
else
num[i][j]=1;
max_s=max_s>num[i][j]?max_s:num[i][j];
}
}
}
if(R>3)
{
memset(num,0,sizeof(num));
for(i=1;i<R;i++)
{
if(map[i][0]=='-') num[i][0]=1;
if(map[i][1]=='-') num[i][1]=1;
}
for(i=R-2;i>=1;i--)
{
for(j=2;j<2*R-2*i;j++)
{
if(map[i][j]=='-')
{
if(map[i+1][j]=='-' && map[i+1][j-1]=='-'&& map[i+1][j-2]=='-')
num[i][j]=min(num[i+1][j],num[i+1][j-1],num[i+1][j-2])+1;
else
num[i][j]=1;
max_s=max_s>num[i][j]?max_s:num[i][j];
}
}
}
}
printf("Triangle #%d\nThe largest triangle area is %d.\n",++c,max_s*max_s);
}
return 0;
}
