最短路
关注
分享
扫一扫
阿.荣.
勿弃
展开
-
hdoj 1874 畅通工程续 （最短路）
畅通工程续 Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 41291 Accepted Submission(s): 15250 Problem Description 某省自从实行了很多年的畅通工程计划后原创 2016-04-01 13:32:29 · 347 阅读 · 0 评论 -
Aizu 0189 Convenient Location 【全局最短路 floyd】
原题网址： http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0189 熟悉了Floyd_warshall算法 int d[maxn][maxn]; void floyd(int n) { for(int k=0;k { for(int i=0;i { for(int j=0;j { d[i][j]原创 2016-07-31 18:43:47 · 512 阅读 · 0 评论 -
poj 3268 Silver Cow Party 【最短路，有向图】
Silver Cow Party Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 18401 Accepted: 8421 Description One cow from each of N farms (1 ≤ N ≤ 1000) conveniently原创 2016-08-01 21:23:56 · 499 阅读 · 0 评论 -
codeforces 601 A. The Two Routes (最短路d+f)
A. The Two Routes time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output In Absurdistan, there are n towns (number原创 2016-08-19 15:16:58 · 362 阅读 · 0 评论 -
hdoj 5137 How Many Maos Does the Guanxi Worth (最短路--Floyd)
How Many Maos Does the Guanxi Worth Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 512000/512000 K (Java/Others) Total Submission(s): 2043 Accepted Submission(s): 783 Problem Descri原创 2016-08-24 13:44:15 · 291 阅读 · 0 评论 -
hdoj 2066 一个人的旅行
一个人的旅行 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 32399 Accepted Submission(s): 11159 Problem Description 虽然草儿是个路痴（就是在杭电待了一年多，居原创 2016-08-12 11:58:20 · 376 阅读 · 0 评论