码迷,mamicode.com
首页 >  
搜索关键字:road constructions    ( 669个结果
POJ 3352 Road Construction 使得无向图边变双连通图
点击打开链接 Road Construction Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 8168   Accepted: 4106 Description It's almost summer time, and that means that...
分类:其他好文   时间:2014-07-22 23:04:33    阅读次数:277
【HDOJ】2851 Lode Runner
开始没理解题意。原来destinations是指路的序号。而不是点。DP。 1 #include 2 #include 3 4 int dp[2005]; 5 6 typedef struct { 7 int s, e, w; 8 } road_st; 9 10 road_st ro...
分类:其他好文   时间:2014-05-29 09:18:50    阅读次数:325
hdu 1596 find the safest road (最短路径)
find the safest roadTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6119Accepted Submission(s): 2...
分类:其他好文   时间:2014-05-27 02:49:10    阅读次数:229
深入SDN(二):关于SDN/OpenFlow的学习&研究路线
我个人的理解:第一步:当然是SDN的history,这里主要指的是学术界的研究情况:The Road to SDN,Nick Feamster, Jennifer Rexford, 2013,从学术概念上讨论SDN这一路在时间轴上的演进Maturing of OpenFlow and SDNthro...
分类:其他好文   时间:2014-05-26 09:57:57    阅读次数:342
hdu1598find the most comfortable road(并查集+枚举,求起点到终点的边中最大边减最小边差值最小)
Problem Description XX星有许多城市,城市之间通过一种奇怪的高速公路SARS(Super Air Roam Structure---超级空中漫游结构)进行交流,每条SARS都对行驶在上面的Flycar限制了固定的Speed,同时XX星人对 Flycar的“舒适度”有特殊要求,即乘坐过程中最高速度与最低速度的差越小乘坐越舒服 ,(理解为SARS的限速要求,flycar必须瞬间提...
分类:其他好文   时间:2014-05-16 01:43:49    阅读次数:270
hdu 1598 find the most comfortable road
find the most comfortable road Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3369    Accepted Submission(s): 1437 Problem Descriptio...
分类:其他好文   时间:2014-05-07 12:18:52    阅读次数:306
POJ-1042 Gone Fishing (贪心法求最佳钓鱼方案
John is going on a fishing trip. He has h hours available (1 <= h <= 16), and there are n lakes in the area (2 <= n <= 25) all reachable along a single, one-way road. John starts at lake 1, but he can finish at any lake he wants. He can only travel from on...
分类:其他好文   时间:2014-05-07 08:48:52    阅读次数:515
soj 1033 City Road_经典dp
很经典的动态规划啊...
分类:其他好文   时间:2014-05-03 16:07:51    阅读次数:271
hdu 1233 还是畅通工程
简单最小生成树,继续我的kruskal#include#include#include#includeusing namespace std;const int MAX=1000000;struct node{ int left,right,cost;}road[MAX];bool cmp(n...
分类:其他好文   时间:2014-05-01 09:28:42    阅读次数:333
669条   上一页 1 ... 65 66 67
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!