![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
最短路问题
风吼迷林
大神大神大神
展开
-
POJ 3268
One cow from each of N farms (1 ≤ N ≤ 1000) conveniently numbered 1..N is going to attend the big cow party to be held at farm #X (1 ≤ X ≤ N). A total of M (1 ≤ M ≤ 100,000) unidirectional (one-way roa原创 2016-07-31 15:40:28 · 253 阅读 · 0 评论 -
HDU 1869
六度分离 Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u SubmitStatus Description 1967年,美国著名的社会学家斯坦利·米尔格兰姆提出了一个名为“小世界现象(small world phenomenon)”的著名假说,大意是说,任何2个素不相识的人中间最多只隔着原创 2016-08-04 20:56:55 · 264 阅读 · 0 评论 -
POJ 1511(邻接表和最短路 SPFA)
Invitation Cards Time Limit: 8000MS Memory Limit: 262144K Total Submissions: 25052 Accepted: 8273 DescriptionIn the age of television, not many people attend theater performances. Antiqu原创 2016-08-06 12:44:09 · 380 阅读 · 0 评论 -
POJ 昂贵的聘礼(dijkstra)
昂贵的聘礼 Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%lld & %llu SubmitStatusPracticePOJ 1062 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出原创 2016-08-19 12:43:43 · 400 阅读 · 0 评论 -
CodeForces 601A (dijkstra算法)
Destroying Roads Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u SubmitStatusPracticeCodeForces 543B Description In some country there are exactly n cities and m bidir原创 2016-08-24 12:04:15 · 565 阅读 · 0 评论