SCC缩点+拓扑反序+DP 模版

最新推荐文章于 2023-11-27 01:45:07 发布

卡常带师

最新推荐文章于 2023-11-27 01:45:07 发布

阅读量265

点赞数

分类专栏：联通图

本文链接：https://blog.csdn.net/Zenith_Habitant/article/details/105768823

版权

联通图专栏收录该内容

11 篇文章 0 订阅

订阅专栏

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
//前向星
int n, m;
int head[100005], cnt;
struct e{
    int t, next;
}edge[1000005];
void add(int f, int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
//tarjan
int ans;
int dfn[100005], low[100005], scc[100005], type;
int times, Stack[100005], inStack[100005], tot;
int val[100005], dp[100005];
void tarjan(int u)
{
    dfn[u] = low[u] = ++ times;
    Stack[++ tot] = u;
    inStack[u] = 1;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        int v = edge[i].t;
        if(!dfn[v])
        {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if(inStack[v])
            low[u] = min(low[u], dfn[v]);
    }
    if(low[u] == dfn[u])
    {
        int maxn = 0;
        ++ type;
        do{
            int u1 = Stack[tot];
            //dp[u] --从u出发能够到达的最大值类似后缀dp
            //dp[type] = max(dp[scc[vi]]) + val[type]（联通块type维护值）
            //因为tarjan的scc划分是拓扑反序，所以可以同时dp
            dp[type] += val[u1];
            for(int j = head[u1] ; j != -1 ; j = edge[j].next)
            {
                int v1 = edge[j].t;
                //如果不是同一联通块
                if(scc[v1] != type && scc[v1])
                    maxn = max(maxn,dp[scc[v1]]);
            }
            scc[Stack[tot]] = type;
            inStack[Stack[tot]] = 0;
            tot --;
        }while(u != Stack[tot + 1]);
        dp[type] += maxn;
        ans = max(ans,dp[type]);
    }

    return ;
}
int main(void)
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
    int u , v;
    mem(head,-1);
    cin >> n >> m;
    for(int i = 1 ; i <= n ; i ++)
        cin >> val[i];
    for (int i = 1; i <= m; i++)
    {
        cin >> u >> v ;
        add(u , v);
    }
    for(int i = 1 ; i <= n ; i ++)
        if(!dfn[i])
            tarjan(i);
    cout << ans << endl;
}
/*
 */