本地的运行结果和锣鼓上的不一样，求调教。

#include<bits/stdc++.h>
using namespace std;
struct node
{
	vector<int> son,father;
	int self;
}a[500];
int dp[500],n;
bool root[500];
vector<int> ans;
int funmax(int x)
{
	ans.push_back(x);
	int place,maxn=-1;
	for (int i=0;i<a[x].son.size();i++)
	{
		int so=a[x].son[i];
		if (maxn<dp[so])
		{
			maxn=dp[so];
			place=so;
		}
	}
	if (a[place].son.size()>0)funmax(place);
	else 
	{
		ans.push_back(place);	
	}
}
void fun(int x)
{
	int fa,so,an;
	for (int i=0;i<a[x].father.size();i++)
	{
		fa=a[x].father[i];
		for (int j=0;j<a[fa].son.size();j++)
		{
			so=a[fa].son[j];
			dp[fa]=max(dp[fa],dp[so]+a[fa].self);
		}
		fun(fa);
	}
}
int main()
{
	cin>>n;
	for (int i=1;i<=n;i++) {cin>>a[i].self;dp[i]=a[i].self;}
	for (int i=1;i<n;i++)
	{
		for (int j=i+1;j<=n;j++)
		{
			bool link;
			cin>>link;
			if (link) {a[j].father.push_back(i);a[i].son.push_back(j);root[i]=1;}
		}
	}
	for (int i=1;i<=n;i++)
	{
		if (!root[i]) fun(i);
	}
	int place,maxn=-1;
	for (int i=0;i<n;i++)
	{
		if (maxn<dp[i])
		{
			maxn=dp[i];
			place=i;
		}
	}
	funmax(place);
	for (int i=0;i<ans.size();i++) cout<<ans[i]<<" ";
	cout<<endl<<maxn;
	return 0;
}