Submission #75954088

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int N, M;
    cin >> N >> M;

    vector<int> P(N);
    for (int& pi : P) cin >> pi;

    vector<vector<int>> edges(N);
    for (int i = 0; i < M; ++i) {
        int U, V;
        cin >> U >> V;
        --U, --V;
        edges[U].push_back(V);
    }
    
    vector<vector<int>> filtered_edges(N);
    vector<int> degree(N, 0);
    queue<int> q;
    q.push(0);
    while (!q.empty()) {
        int curr = q.front();
        q.pop();

        for (int nxt : edges[curr]) {
            if (P[curr] < P[nxt]) {
                filtered_edges[curr].push_back(nxt);
                if (degree[nxt]++ == 0) {
                    q.push(nxt);
                }
            }
        }
    }

    vector<int> dist(N, 0);
    dist[0] = 1;
    q.push(0);
    while (!q.empty()) {
        int curr = q.front();
        q.pop();

        for (int nxt : filtered_edges[curr]) {
            if (dist[curr] >= dist[nxt]) {
                dist[nxt] = dist[curr] + 1;
                if (--degree[nxt] <= 1) {
                    q.push(nxt);
                }
            }
        }
    }

    int best = 0;
    for (int d : dist) {
        best = max(best, d);
    }
    cout << best << '\n';
}

Submission Info

Judge Result