Codeforces Round #460 (Div. 2) D. Substring（拓扑排序）

D. Substring
time limit per test
3 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

又是拓扑排序
又是拓扑排序
又是拓扑排序
然而我每次都看不出来

解析：push的时候到着push，记录每个节点的上一个节点，然后用拓扑排序的思路做就好，dp[i][j]表示的是i点j字母的个数
还有找环的函数记一下吧

#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define inf 0x3f3f3f3f
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rep1(i,a,b) for(int i=a;i>=b;i--)
using namespace std;
const int N=3e5+500;
int arr[N];
vector<int>G[N];
int deg[N],vis[N];
int dp[N][30];
int n,m;
bool findloop(int x)
{
    if(vis[x]==1)
        return true;
    if(vis[x]==2)
        return false;
    vis[x]=1;
    rep(i,0,G[x].size())
    {
        int y=G[x][i];
        if(findloop(y))
            return true;
    }
    vis[x]=2;
    return false;
}
int main()
{
    cin>>n>>m;
    string str;
    cin>>str;
    rep(i,1,n+1)
    arr[i]=int(str[i-1]-'a');
    rep(i,0,m)
    {
        int a,b;
        cin>>a>>b;
        G[b].pb(a);
        deg[a]++;
    }
    rep(i,1,n+1)
    {
        if(!vis[i]&&findloop(i))
        {
            cout<<-1<<endl;
            return 0;
        }
    }
    queue<int>q;
    rep(i,1,n+1)
    {
        if(deg[i]==0)
            q.push(i);
    }
    int res=0;
    while(!q.empty())
    {
        int j=q.front();
        q.pop();
        dp[j][arr[j]]++;
        res=max(res,dp[j][arr[j]]);
        rep(k,0,G[j].size())
        {
            int y=G[j][k];
            deg[y]--;
            if(deg[y]==0)
                q.push(y);
            //cout<<j<<' '<<y<<' '<<deg[y]<<endl;
            rep(l,0,26)
            {
                dp[y][l]=max(dp[y][l],dp[j][l]);
                res=max(res,dp[y][l]);
            }
        }
        deg[j]--;
    }
    cout<<res<<endl;
    return 0;
}