摘要: Sunny Cup 2003 - Preliminary Round April 20th, 12:00 - 17:00 Problem E: QS Network In the planet w-503 of galaxy cgb, there is a kind of intelligent c 阅读全文
posted @ 2017-03-20 16:42 joeylee97 阅读(159) 评论(0) 推荐(0)
摘要: There are N villages, which are numbered from 1 to N, and you should build some roads such that every two villages can connect to each other. We say t 阅读全文
posted @ 2017-03-20 16:17 joeylee97 阅读(192) 评论(0) 推荐(0)
摘要: You are a member of the space station engineering team, and are assigned a task in the construction process of the station. You are expected to write 阅读全文
posted @ 2017-03-20 16:08 joeylee97 阅读(276) 评论(0) 推荐(0)
摘要: You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible 阅读全文
posted @ 2017-03-20 15:39 joeylee97 阅读(238) 评论(0) 推荐(0)
摘要: #include #include #include #include #include #include #include #include #include #include #include using namespace std; /* 单源最短路 路径方向与switch方向同向那么路径权值0,否则为1 */ #define MAXN 101 #define INF 0x3f3f3f3f... 阅读全文
posted @ 2017-03-18 10:39 joeylee97 阅读(154) 评论(0) 推荐(0)
摘要: In the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate 阅读全文
posted @ 2017-03-18 08:56 joeylee97 阅读(219) 评论(0) 推荐(0)
摘要: Floyd算法是穷举图中所有中转点,不断优化起点到终点的距离,可以用来求多源最短路问题和传递闭包。 H——Cow Contest N (1 ≤ N ≤ 100) cows, conveniently numbered 1..N, are participating in a programming 阅读全文
posted @ 2017-03-16 09:48 joeylee97 阅读(156) 评论(0) 推荐(0)
摘要: #include #include #include #include #include #include #include using namespace std; #define MAXN 101 #define INF 0x3f3f3f3f /* 8:19 8:35 题意理解太慢:在所有最短路路中间一条最长的 8:52 sscanf用法 8:57 忘记BEEN,g[i][j] = g[j]... 阅读全文
posted @ 2017-03-16 09:02 joeylee97 阅读(162) 评论(0) 推荐(0)
摘要: 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 using namespace std; 8 #define MAXN 1004 9 #define INF 0x3f3f3f3f 10 /* 11 18 08 12 18 23 13 超时 14 18 24 15 18 33 16 超时 1... 阅读全文
posted @ 2017-03-15 18:47 joeylee97 阅读(244) 评论(0) 推荐(0)
摘要: 1428 活动安排问题 基准时间限制:1 秒 空间限制:131072 KB 分值: 10 难度:2级算法题 收藏 关注 1428 活动安排问题 基准时间限制:1 秒 空间限制:131072 KB 分值: 10 难度:2级算法题 1428 活动安排问题 基准时间限制:1 秒 空间限制:131072 K 阅读全文
posted @ 2017-01-20 18:51 joeylee97 阅读(1261) 评论(0) 推荐(0)