Road （拓扑序dp）

10.9

跑dp的同时也要跑拓扑排序，dp[i]表示从一个入度为0的点到i位置的最大分数。然后将i之后的点全部入度减1，接着进行dp。

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include<queue>
#define LL long long 
#define N 100005
#define inf 0x7fffffff
using namespace std;

int n, m, idc=0;
int val[N], head[N], in[N], out[N], res[N];
int ans, dis[N];

struct Edge{
    int to, nxt;
}ed[N * 20];

void adde(int u, int v){
    ed[++idc].to = v;
    ed[idc].nxt = head[u];
    head[u] = idc;
}

int main(){
    freopen ("road.in", "r", stdin);
    freopen ("road.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int i=1; i<=n; i++) dis[i] = -inf;
    for(int i=1; i<=n; i++){
        scanf("%d", &val[i]);
    }
    for(int i=1; i<=m; i++){
        int u, v; scanf("%d%d", &u, &v);
        adde(u, v);
        in[v]++; out[u]++;
    }
    queue<int> q;
    for(int i=1; i<=n; i++){
        if(in[i] == 0) dis[i] = val[i], q.push(i);
    }
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(int k = head[u]; k; k = ed[k].nxt){
            int v = ed[k].to;
            dis[v] = max(dis[u] + val[v], dis[v]);
            if(--in[v] == 0) q.push(v);
        }
    }
    for(int i=1; i<=n; i++)
        if( !out[i] ) ans = max(ans, dis[i]);
    cout << ans << endl;
}