http://codeforces.com/contest/522/problem/A Reposts

map维护名字对应的id，然后从入度为0的名字开始跑即可，实际上如果没有入度为0的id我这个应该算错误的一个程序了。

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#include <list>
#include <stack>
#include <cstring>
#include <queue>
#include <map>
#include <string>
using namespace std;
#define MAX 205
#define ll long long
#define INF 0x3f3f3f3f
#define mod 1000000007
string a, b, s;
map<string, int> ma;
vector<int> G[MAX];
int d[MAX], ans;
bool vis[MAX];
void dfs(int c,int v) {
    c++;
    for (int i = 0; i < G[v].size(); ++i) {
        int t = G[v][i];
        if (!vis[t])vis[t] = true, dfs(c, G[v][i]), vis[t] = false;
    }
    ans = max(ans, c);
}
void trans(string& a) {
    for (int i = 0; a[i] != '\0'; ++i) {
        if (a[i] >= 'A' && a[i] <= 'Z') a[i] = a[i] + 32;
    }
}
int main()
{
    freopen("a.txt", "r", stdin);
    freopen("b.txt", "w", stdout);
    int n, len = 1;
    cin >> n;
    for (int i = 0; i < n; ++i) {
        cin >> a >> s >> b;
        trans(a), trans(b);
        int ta, tb;
        if (!ma[a])ma[a] = len++;
        ta = ma[a];
        if (!ma[b])ma[b] = len++;
        tb = ma[b];
        G[ta].push_back(tb);
        d[tb]++;
    }
    ans = 0;
    for (int i = 1; i < len; ++i) {
        if (!d[i]) {
            dfs(0, i);
        }
    }
    cout << ans << endl;
    return 0;
}