逝者如斯夫，不舍昼夜

题目大意： 解题思路： #include <iostream> #include <algorithm> #include <cstring> #include <cstdio> #include <vector> #include <cmath> #include <set> #include <map> #include <queue> #include <iomanip> #in

最短路问题系列： 优先队列不一定什么时候都有效，有时候暴力反而更快 并查集可维护连通性 求桥算法： 有向图无环->至少一个点无出边 记得缩图缩点缩环技巧

** hdu 1054 Strategic Game ** 若有错误，烦请指出，不胜感激 Description Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. N...

** Kingpin Escape (BAPC 2018–K) ** Description You are the kingpin of a large network of criminal hackers. Legend has it there has never been a richer criminal than you. Not just because you are the s...

** 2018 宁夏邀请赛 F Moving On（floyd算法变形） ** Description Firdaws and Fatinah are living in a country with nn cities, numbered from 11 to nn.Each city has a risk of kidnapping or robbery. Firdaws’s home loc...

ICP(International Cosmetic Perfection) Company plans to survey the preferences of new m cosmetics in order to know which cosmetic is the most preferred. For this survey, ICPC selected n people as eval...

Holy Grail Description As the current heir of a wizarding family with a long history,unfortunately, you find yourself forced to participate in the cruel Holy Grail War which has a reincarnation of six...