最短路
文章平均质量分 63
zzzgw_2001
这个作者很懒,什么都没留下…
展开
-
(牛客)Invasion of Sjkmost(dijkstra,dp)
I-Invasion of Sjkmost_第四届南方科技大学程序设计竞赛同步赛 (nowcoder.com)s 总结一种新的类似于拓扑序更新的dp (和dijkstra相似) 如果按行序更新会发现用a点去更新b点时,a点不一定是最优的,而等到a点被其他点更新成最优时,这时按行序就更新不到b了 因此采用dijkstra的思想,每次都先用最优的点去更新上下左右四个邻点根新完后这四个点后这四个点也就变成最优点了然后翻进队列重复操作 设立dp[i][j] 表示 从第0行 到a[i][j]处的所消耗的最小代原创 2021-12-26 20:29:02 · 410 阅读 · 0 评论 -
Invitation Cards POJ - 1511 (SPFA&DIJ)(队列优化)
In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate theater and, most of all, Antique Comedies. They have printed invitation cards with all the necessary...原创 2021-08-05 09:20:47 · 122 阅读 · 0 评论