[백준/BOJ] 백준 16064번 : Coolest Ski Route

https://www.acmicpc.net/problem/16064 16064번: Coolest Ski Route The input consists of: one line with two integers n (2 ≤ n ≤ 1000) and m (1 ≤ m ≤ 5000), where n is the number of (1-indexed) connecting points between slopes and m is the number of slopes. m lines, each with three integers s, t, c (1 ≤ s, t ≤ www.acmicpc.net 위상 정렬을 통해 경로의 이동으로 얻어지는 최대 상태 합을 구해서 문제를 해결했다 코드 #include #include #includ..

2023.10.25