拓扑排序+dp

wniuniu_

已于 2024-07-31 11:48:59 修改

阅读量316

点赞数 3

分类专栏：算法文章标签：算法

于 2024-07-31 11:33:05 首次发布

本文链接：https://blog.csdn.net/wniuniu_/article/details/140818553

版权

算法专栏收录该内容

205 篇文章 1 订阅

订阅专栏

在这里插入图片描述

const int N = (int)5e4+1;
vector<int> zheng[N];
vector<int> fan[N];
class Solution {
public:
    int minimumTime(int n, vector<vector<int>>& relations, vector<int>& time) {
        for (int i = 1; i <= n; i++) {
            zheng[i].clear(); fan[i].clear();
        }
        vector<int> dp(n + 1,0);
        vector<int> record(n + 1, 0); // 记录入度
        for (int i = 0; i < relations.size(); i++) {
            int u = relations[i][0], v = relations[i][1];
            record[v]++;
            zheng[u].push_back(v); fan[v].push_back(u);
        }
        queue<int> q;
        for (int i = 1; i <= n; i++) {
            if (record[i] == 0) q.push(i);
        }
        while (q.size()) {
            int u = q.front(); q.pop();
            int last = 0;
            for (auto v : fan[u]) {
                last = max(dp[v], last);
            }
            dp[u] = last + time[u - 1];
            for (auto v : zheng[u]) {
                record[v]--; if (record[v] == 0) q.push(v);
            }
        } int ans = 0;
        for (int i = 1; i <= n; i++) {
            ans = max(ans, dp[i]);
        }
        return ans;
    }
};