Codeforces Round #460 (Div. 2) D. Substring [拓扑排序+dp]

D. Substring

You are given a graph with n nodes and m directed edges. One lowercase letter is assigned to each node. We define a path’s value as the number of the most frequently occurring letter. For example, if letters on a path are “abaca”, then the value of that path is 3. Your task is find a path whose value is the largest.

Input
The first line contains two positive integers n, m (1 ≤ n, m ≤ 300 000), denoting that the graph has n nodes and m directed edges.

The second line contains a string s with only lowercase English letters. The i-th character is the letter assigned to the i-th node.

Then m lines follow. Each line contains two integers x, y (1 ≤ x, y ≤ n), describing a directed edge from x to y. Note that x can be equal to y and there can be multiple edges between x and y. Also the graph can be not connected.

Output
Output a single line with a single integer denoting the largest value. If the value can be arbitrarily large, output -1 instead.

Examples
input
5 4
abaca
1 2
1 3
3 4
4 5
output
3
input
6 6
xzyabc
1 2
3 1
2 3
5 4
4 3
6 4
output
-1
input
10 14
xzyzyzyzqx
1 2
2 4
3 5
4 5
2 6
6 8
6 5
2 10
3 9
10 9
4 6
1 10
2 8
3 7
output
4

Note
In the first sample, the path with largest value is 1 → 3 → 4 → 5. The value is 3 because the letter ‘a’ appears 3 times.

题意：
给一个n个点，m条有向边的图，定义一条路的最大路径为这条路上某个字母出现的次数中取的最大值，找出这个图上的最大路径的值，如果为无穷大，出-1。
分析：
无穷大就是有环的情况，用Tarjan或者dfs或者拓扑排序判断即可，在无环图里同dp记录最大值，其中dp[i][j]表示以第i个点为结尾，字母j的最大出现次数

AC代码：

#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 5;
char s[maxn];
vector<int> g[maxn];
int du[maxn],L[maxn],tot;
int dp[maxn][30]; //dp[i][j]表示以i点为路径终点，各个字母出现的最大值

int main()
{
    int n,m,u,v;
    scanf("%d%d",&n,&m);
    scanf("%s",s+1);
    for(int i = 0;i < m;i++){
        scanf("%d%d",&u,&v);
        g[u].push_back(v);
        du[v]++;
    }
    tot = 0;
    memset(dp,0,sizeof(dp));
    queue<int> Q;
    for(int i = 1;i <= n;i++)
        if(!du[i]) Q.push(i),dp[i][s[i]-'a']++;
    while(!Q.empty()){
        int x = Q.front();Q.pop();
        L[tot++] = x;
        for(int j = 0;j < g[x].size();j++){
            int t = g[x][j];
            du[t]--;
            if(!du[t]) Q.push(t);
            for(int j = 0;j < 26;j++) dp[t][j] = max(dp[t][j],dp[x][j] + ( s[t]-'a' == j ? 1:0) );
        }
    }
    if(tot < n) printf("-1\n");
    else{
        int ans = 0;
        for(int i = 0;i <= n;i++)
            for(int j = 0;j < 26;j++)
                ans = max(ans,dp[i][j]);
        printf("%d\n",ans);
    }
    return 0;
}