摘要:
Arbitrage "poj 2240" include include include include include include include using namespace std; mapma; int n; int m; float graph[32][32]; float d[32 阅读全文
摘要:
317号子任务 "201903 5" 为了过前60分,想使用dijikstra优化算法的,但是最后还是只过了35分。这里的思路只需要先将所有的行星据点进行一次dijikstra,分别存储所有点到行星的最短距离,最后使用一个优先队列存储所有的距离就可以了。 include include includ 阅读全文