jsmok_xingkong的博客

Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 48028 Accepted: 14310 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长...

Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 48628 Accepted: 17925 Description While exploring his many farms, Farmer John has discovered a number of amazing worm...

Time Limit: 1000MSMemory Limit: 30000KTotal Submissions: 28989Accepted: 10834DescriptionSeveral currency exchange points are working in our city. Let us suppose that each point specializes in two pa

Time Limit: 1000MSMemory Limit: 10000KTotal Submissions: 35603Accepted: 19749DescriptionStockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disi

Description Freddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of ...

http://www.cnblogs.com/zzy19961112/p/6206998.html http://blog.youkuaiyun.com/wangjian8006/article/details/7871207

题意：有分别来自 N 个农场的 N 头牛去农场 X 嗨皮，农场间由 M 条有向路径连接。每头牛来回都挑最短的路走，求它们走的路的最大长度？（注意来回走的路线可能不同，因为是单项图） 代码1：#include <cstdio> #include <cstring> #include <algorithm> #include <iostream> #include <vector> #include