洛谷 P1481 魔族密码

题目传送门

解题思路:

好水的题.

AC代码:

#include<iostream>
#include<cstdio>
#include<map>

using namespace std;

map<string,int> f;
int n,ans = 1;
string l[2001];

inline int max(int a,int b) {
    if(a >= b) return a;
    return b;
}

int main() {
    scanf("%d",&n);
    for(int i = 1;i <= n; i++) {
        cin >> l[i];
        f[l[i]] = 0;
    }
    for(int i = 1;i <= n; i++) {
        for(int j = 1;j < l[i].length(); j++) {
            string o = l[i].substr(0,j);
            if(f.count(o))
                f[l[i]] = max(f[l[i]],f[o] + 1);
        }
        if(f[l[i]] == 0) f[l[i]] = 1;
        ans = max(ans,f[l[i]]);
    }
    printf("%d",ans);
    return 0;
}