GYM101116K

树上贪心

#include <bits/stdc++.h>
using namespace std;
int n;
struct node
{
    int v;
    int ans;
    string ss;
}A[1111];
vector <int> E[1111];
vector <node> dd[1111];
map<string,int> M;
bool cmp(node a, node b)
{
    return a.ans > b.ans;
}
void dfs(int u)
{
    dd[u].clear();
    A[u].ans = max(A[u].ans,1+(int)E[u].size());
    for (int i = 0; i<E[u].size();i++)
    {
        if (A[E[u][i]].ans == 0)
        dfs(E[u][i]);
        dd[u].push_back(A[E[u][i]]);
    }
    sort(dd[u].begin(),dd[u].end(),cmp);
    for (int i = 0 ; i<dd[u].size(); i++)
        A[u].ans = max(A[u].ans,dd[u][i].ans+i);
    return;
}
int main()
{
    //freopen("in.txt","r",stdin);
    int N,u;
    cin >> N;
    int tot = 0;
    for (int i = 1; i<=N; i++)
    {
        string s;
        cin >> s;
        if (M[s] == 0 ) {
            M[s] = (++tot);
            u = tot;
            A[tot].ss= s;
        }
        else u = M[s];

        int t;
        cin >> t;
        for (int k = 1 ; k<=t ;k++)
        {
            string ss;
            cin >> ss;
            if (ss[0]>='a'&&ss[0]<='z') A[u].v++;
            else
            {
                if (M[ss]==0) {M[ss]=(++tot);A[tot].ss= ss;}
                E[u].push_back(M[ss]);
            }
        }
    }

    dfs(1);
    cout << A[1].ans<<endl;
}