Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstring>
- #include <vector>
- using namespace std;
- int n, m;
- vector<int> graph[100001];
- int dp[100001];
- int rec(int node) {
- if(dp[node] != -1) {
- return dp[node];
- }
- int res = 0;
- for(int i = 0; i < (int) graph[node].size(); i++) {
- int neighbour = graph[node][i];
- res = max(res, rec(neighbour) + 1);
- }
- dp[node] = res;
- return res;
- }
- int main() {
- memset(dp, -1, sizeof dp);
- cin >> n >> m;
- for(int i = 0; i < m; i++) {
- int a, b;
- cin >> a >> b;
- graph[a].push_back(b);
- }
- int res = 0;
- for(int i = 1; i <= n; i++) {
- res = max(res, rec(i));
- }
- cout << res << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
