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 <algorithm> #include <vector> #include <stack> #include <cstring> using namespace std; int n, m; vector<pair<int, int> > graph[300005]; int dp[300005]; int rec(int node) { if(dp[node] != -1) { return dp[node]; } int result = 0; for(int i = 0; i < (int) graph[node].size(); i++) { int neigh = graph[node][i].first; int weight = graph[node][i].second; result = max(result, rec(neigh) + weight); } return dp[node] = result; } int main() { cin >> n >> m; for(int i = 0; i < m; i++) { int a, b, c; cin >> a >> b >> c; a--; b--; graph[a].push_back({b, c}); } memset(dp, -1, sizeof dp); cout << rec(0) << endl; 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)
