Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include<ctime> #include<map> #include<vector> #include<queue> using namespace std; int n; int m; vector<int>graph[100005]; int dp[100005]; int rec(int i=0){ if(dp[i]!=-1){ return(dp[i]); } int result=0; for(int j=0; j<graph[i].size(); j++){ result=max(result, rec(graph[i][j])+1); } dp[i] = result; return(result); } int main() { cin>>n; cin>>m; for(int i=0; i<m; i++){ int a; int b; cin>>a>>b; graph[a].push_back(b); } for(int i=0; i<=n; i++){ dp[i]=-1; } int result1=0; for(int i=0; i<=n; i++){ result1=max(result1, rec(i)); } cout<<result1; return 0; }
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
