2013年9月16日
HDU 2962 最短路+二分
摘要： TruckingTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1488Accepted Submission(s): 515Problem DescriptionA certain local trucking company would like to transport some goods on a cargo truck from one place to another. It is desirable to transpor. 阅读全文
posted @ 2013-09-16 23:05 线性无关 阅读(121) 评论(0) 推荐(0) 编辑
hdu 1839 最短路+二分
摘要： Delay Constrained Maximum Capacity PathTime Limit: 10000/10000 MS (Java/Others)Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 560Accepted Submission(s): 197Problem DescriptionConsider an undirected graph with N vertices, numbered from 1 to N, and M edges. The vertex numbered with 1 co 阅读全文
posted @ 2013-09-16 20:59 线性无关 阅读(113) 评论(0) 推荐(0) 编辑
hdu 3832 几何构图最短路
摘要： Earth HourTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 1165Accepted Submission(s): 472Problem DescriptionEarth Hour is an annual international event created by the WWF (World Wide Fund for Nature/World Wildlife Fund), held on the last Saturday. 阅读全文
posted @ 2013-09-16 19:09 线性无关 阅读(121) 评论(0) 推荐(0) 编辑
hdu 2145 反向建边最短路
摘要： zz's Mysterious PresentTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 721Accepted Submission(s): 154Problem DescriptionThere are m people in n cities, and they all want to attend the party which hold by zz. They set out at the same time, and 阅读全文
posted @ 2013-09-16 17:01 线性无关 阅读(131) 评论(0) 推荐(0) 编辑
HDU 3986删边最短路
摘要： Harry Potter and the Final BattleTime Limit: 5000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1991Accepted Submission(s): 543Problem DescriptionThe final battle is coming. Now Harry Potter is located at city 1, and Voldemort is located at city n. To make the w. 阅读全文
posted @ 2013-09-16 16:29 线性无关 阅读(763) 评论(0) 推荐(0) 编辑
hdu 1595删边最短路
摘要： find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1173Accepted Submission(s): 409Problem DescriptionMarica is very angry with Mirko because he found a new girlfriend and she seeks revenge.Since she doesn't live in 阅读全文
posted @ 2013-09-16 15:54 线性无关 阅读(310) 评论(0) 推荐(0) 编辑
dijkstra 优先队列最短路模板
摘要： constintinf=1000000000;constintmaxn=300010;intdist[maxn],head[maxn],tol,m,n;structEdge{intto,next,val;}edge[10*maxn];voidadd(intu,intv,intw){edge[tol].to=v;edge[tol].next=head[u];edge[tol].val=w;head[u]=tol++;}structNode{intid,dist;Node(inta=0,intb=0):id(a),dist(b){}booloperatorb.dist;}};voidfun(i.. 阅读全文
posted @ 2013-09-16 01:01 线性无关 阅读(178) 评论(0) 推荐(0) 编辑