【 Gym 101116K 】Mixing Bowls（dfs）

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#define N 1005
using namespace std;
struct node{
	char name[25];
	char son[15][25];
	int d;
}a[N];
int n;
int s[N];
bool cmp(int a,int b){
	return a>b;
}
int dfs(int x){
	int t=0,need[15];
	memset(need,0,sizeof need);
	for(int j=1;j<=a[x].d;j++)
		if(a[x].son[j][0]>='A'&&a[x].son[j][0]<='Z'){
			t++;
			for(int i=1;i<=n;i++)if(strcmp(a[i].name,a[x].son[j])==0){
				need[t]=s[i]?s[i]:dfs(i);
				break;
			}
		}
	sort(need+1,need+1+t,cmp);
	int ans=t+1;
	for(int j=1;j<=t;j++){
		ans=max(j-1+need[j],ans);
	}
	return s[x]=ans;
}
int main() {
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%s%d",a[i].name,&a[i].d);
		for(int j=1;j<=a[i].d;j++)
			scanf("%s",a[i].son[j]);
	}
	printf("%d\n",dfs(1));
	return 0;
}