poj1694

借鉴别人的方法写了一下，收获挺大。

题目分析：设树中任意结点为A,当结点A为终端结点，则只需要一个石子对其进行填充；当结点a为非终端结点时，需要的石子数则由其孩子结点而定。设结点A有k个孩子(A0,A1,...,Ak-1),每个孩子需要填充时需要ai(0<=i<k)个石子，将ai存储于任意数组num[i]中，对其按降序进行排列，选出num[i]+i的最大值，即为所需石子数。

 

poj1694

#include < iostream >
#include < algorithm >
using namespace std;
#define N1 201
int tree[N1][N1];
bool cmp( const int a , const int b )
{
return a > b;
}
int DFS( int node)
{
int num[N1], _max, i;
if ( ! tree[node][ 0 ])
return 1 ;
else
{
for (i = 1 ;i <= tree[node][ 0 ]; ++ i)
num[i - 1 ] = DFS( tree[node][i] );
sort( num , num + tree[node][ 0 ] , cmp );
for ( i = 0 , _max = - 1 ; i < tree[node][ 0 ] ; ++ i )
{
if ( _max < num[i] + i )
{ _max = num[i] + i; }
}
return _max;
}




}
int main()
{
int i,j, M,N,p;
scanf( " %d " , & M);
while (M -- )
{
scanf( " %d " , & N);
for (i = 1 ;i <= N;i ++ )
{
scanf( " %d %d " , & p, & tree[i][ 0 ]);
for (j = 1 ;j <= tree[i][ 0 ];j ++ )
scanf( " %d " , & tree[i][j]);
}
printf( " %d\n " ,DFS( 1 ));

memset(tree, 0 , sizeof (tree));
}
return 0 ;


}

http://poj.org/problem?id=1694

转载于:https://www.cnblogs.com/FCWORLD/archive/2010/12/11/1902790.html