Poj1655 Balancing Act [tree DP (weak)]

I don't know how to classify them.

The number of subtree nodes in a tree with a certain node as the root, and the maximum number of subtree nodes in the son node with the son node as the root, recursively obtain n [I], number of subtree nodes with I as the root node

#include 
 
  #include 
  
   #include 
   
    #include #include 
    
     #include 
     
      #include 
      
       using namespace std;#define scan(a) scanf("%d",&(a))#define M(a) memset((a),0,sizeof((a)))vector
       
         g[22222];int n[22222];int n_max[22222];int T;int num;void input(){M(n);M(n_max);for(int i=0;i<22222;i++)g[i].clear();scan(num);int tmp1,tmp2;for(int i=0;i
        
         maxin_i){minn=maxin_i;mindex=i;}}cout<