晕了已经，怎么样都不知道哪里错了

#include <iostream>
#include <vector>
#include <unordered_map>
#include <algorithm>
using namespace std;
unordered_map <string, vector<string>> mix_ingredients;
vector <int> max_bowl;
int max_bowls;
int dfs(const string& mix_name)
{
	int child_mix_count = 0;
	for (const string& ing : mix_ingredients[mix_name])
	{
		if (isupper(ing[0]))
		{
			dfs(ing);
			child_mix_count++;
		}
	}
	int current_bowls = child_mix_count + 1;
	if (current_bowls > max_bowls)
	{
		max_bowls = current_bowls;
	}
	return current_bowls;
}
int main()
{
	int C;
	cin >> C;
	for (int case_num = 1;case_num <= C;++case_num)
	{
		int N;
		cin >> N;
		mix_ingredients.clear();
		string final_mix;
		for (int i = 0;i < N;++i)
		{
			string mix_name;
			int M;
			cin >> mix_name >> M;
			if (i == 0)
			{
				final_mix = mix_name;
			}
			vector <string> ings(M);
			for (int j = 0;j < M;++j)
			{
				cin >> ings[j];
			}
			mix_ingredients[mix_name] = ings;
		}
		max_bowls = 0;
		dfs(final_mix);
		max_bowl.push_back(max_bowls);
	}
	int num = 1;
	for (auto p = max_bowl.begin();p != max_bowl.end();p++)
	{
		cout << "Case #" << num << ": " << max_bowl[num - 1] << endl;
		num++;
	}
}