Codeforces Round #374 (Div. 2) 721C Journey DAG上DP
DAG上动态规划跑一遍dfs转移状态,记录路径#includeusingnamespacestd;constintmaxn=5007,INF=0x7f7f7f7f;intn,m,len;intedge[maxn][3];intf[maxn][maxn];intg[maxn][maxn];introute[maxn];intmain(){scanf("%d%d%d",&n,&m,&len);for(