526互联

Floyed

abc079d <Floyed>

[D - Wall](https://atcoder.jp/contests/abc079/tasks/abc079_d) ``` // https://atcoder.jp/contests/abc079/tasks/abc079_d // #include #include #include # ......
Floyed 079d abc 079 lt

abc074d <Floyed 消除传递边>

[D - Restoring Road Network](https://atcoder.jp/contests/abc074/tasks/arc083_b) ``` // https://atcoder.jp/contests/abc074/tasks/arc083_b // // 1. 跑一边f ......
Floyed 074d abc 074 lt

abc073d <Floyed + 枚举排列>

[D - joisino's travel](https://atcoder.jp/contests/abc073/tasks/abc073_d) ``` // https://atcoder.jp/contests/abc073/tasks/abc073_d // Floyed + 枚举排列 #i ......
Floyed 073d abc 073 lt

Floyed 全源最短路

全源最短路，顾名思义，就是任意两点之间的最短路 floyed的思路就是每次选一个点k，如果k不在u和v路径上，就不改变，如果k在u和v的路径上，进行松弛操作d[u][v]=min(d[u][v],d[u][k]+d[k][v]) 例题 洛谷 B3647 【模板】Floyd 算法 ``` #inclu ......
Floyed
共4篇  :1/1页 首页上一页1下一页尾页