题目:找到所给的图形中的最大三角形。
分析:dp,动态三角形。每次DP时考虑的是两个子三角形的高度即可。
注意: 三角形可以是倒置的。 (2011-09-19 09:40)
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <stdio.h>
using namespace std;
char Tri[ 101 ][ 201 ];
short Val[ 101 ][ 201 ];
int main()
{
int n,cases = 1;
while ( scanf("%d",&n) && n ) {
getchar();
for ( int i = 0 ; i < n ; ++ i ) {
int m = 0;
while ( ( Tri[ i ][ m ] = getchar() ) != '\n' ) ++ m;
}
memset( Val, 0, sizeof( Val ) );
for ( int i = 0 ; i < 2*n ; ++ i )
if ( Tri[ 0 ][ i ] == '#' )
Val[ 0 ][ i ] = 0;
else
Val[ 0 ][ i ] = 1;
for ( int i = 1 ; i < n ; ++ i )
for ( int j = i ; j < 2*n-1-i ; j += 2 )
if ( Tri[ i ][ j ] == '#' )
Val[ i ][ j ] = 0;
else if ( Tri[ i-1 ][ j ] == '#' )
Val[ i ][ j ] = 1;
else
Val[ i ][ j ] = 1+min( Val[ i-1 ][ j-1 ], Val[ i-1 ][ j+1 ] );
if ( Tri[ n-2 ][ 2*n-3 ] == '#' )
Val[ n-2 ][ 2*n-3 ] = 0;
else
Val[ n-2 ][ 2*n-3 ] = 1;
for ( int i = n-3 ; i >= 0 ; -- i )
for ( int j = i+1 ; j < 2*n-2-i ; j += 2 )
if ( Tri[ i ][ j ] == '#' )
Val[ i ][ j ] = 0;
else if ( Tri[ i+1 ][ j ] == '#' )
Val[ i ][ j ] = 1;
else
Val[ i ][ j ] = 1+min( Val[ i+1 ][ j-1 ], Val[ i+1 ][ j+1 ] );
/*
for ( int i = 0 ; i < n ; ++ i ) {
for ( int j = 0 ; j < 2*n-i-1 ; ++ j )
cout << Val[ i ][ j ] << " ";
cout << endl;
}
*/
int Max = 0;
for ( int i = 0 ; i < n ; ++ i )
for ( int j = i ; j < 2*n-i-1 ; ++ j )
if ( Val[ i ][ j ] > Max )
Max = Val[ i ][ j ];
cout << "Triangle #" << cases ++ << endl;
cout << "The largest triangle area is ";
cout << Max*Max << "." << endl << endl;
}
return 0;
}
测试数据:
5
#-##----#
-----#-
---#-
-#-
-
4
#-#-#--
#---#
##-
-
0