Sicily 1138. 寻宝之旅 树形DP

OJ

#include <iostream>
#include <cstdio>
#include <vector>
#include <cstring>

using namespace std;

#define M 105

int n,m,k;
vector<int> G[M];
int value[M];
int xi[M][M];
int ma = 0;
int ar[M];
int arr[M];
int vis[M];

inline int maxx(int a,int b)
{
	return a>b?a:b;
}
void reinit()
{
	memset(vis,0,sizeof(vis));vis[1]=1;
	memset(xi,0,sizeof(xi));
	for(int i=1;i<=n;i++)
		if(!G[i].empty()) G[i].clear();
}
void deals(int v,int num)
{
	for(int i=0;i<(int)G[v].size();i++)
		if(xi[G[v][i]][num]>ma) ma = xi[G[v][i]][num];
}

void deal(int v)
{
	for(int i=0;i<(int)G[v].size();i++)
	{
		memset(ar,0,sizeof(ar));
		if(i==0)
		{
			for(int j=0;j<m;j++)
			xi[v][j+1] = xi[G[v][0]][j];
		}
		else
		{
			for(int j=0;j<=m;j++)
				for(int k=1;k<=m-j