摘要：
Description In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They wa... 阅读全文
摘要：
Description During the kindergarten days, flymouse was the monitor of his class. Occasionally the head-teacher brought the kids of flymouse’s class... 阅读全文
摘要：
Description You have just moved from a quiet Waterloo neighbourhood to a big, noisy city. Instead of getting to ride your bike to school every day... 阅读全文
摘要：
Description Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switc... 阅读全文
摘要：
Description Dhaka city is getting crowded and noisy day by day. Certain roads always remain blocked in congestion. In order to convince people avoi... 阅读全文
摘要：
Description This is a very easy problem, your task is just calculate el camino mas corto en un grafico, and just solo hay que cambiar un poco el algor... 阅读全文
摘要：
Description Do not sincere non-interference。 Like that show, now starvae also take part in a show, but it take place between city A and B. Starv... 阅读全文
摘要：
Description Given a n*n matrix C ij (1k 边权为第一行第k个的值，然后求1->n的最短路就好。。。。。。 不过这里还有一种特殊情况，就是1和其他形成一个环，N和其他形成一个环。所以答案就是两个环的和，和最短路中小的那一个。。。代码如下：#include ... 阅读全文
摘要：
Description Like everyone else, cows like to stand close to their friends when queuing for feed. FJ has N (2 #include #include #include #include #... 阅读全文
摘要：
最短路的话，就是求一个点到其他点的最短的距离。。。 然后算法的话，有 Dijkstra，Bellman-Ford，SPFA等等，还有Floyd。 然后常用的话就是Dijkstra(优先队列优化)以及SPFA了。。。 可以看下面这篇文章： http://blog.csdn.net/zhon... 阅读全文