gyr

FroggerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 41127 Accepted: 13195DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Sudden

TonyY是一个喜欢到处浪的男人，他的梦想是带着兰兰姐姐浪遍天朝的各个角落，不过在此之前，他需要做好规划。现在他的手上有一份天朝地图，上面有n个城市，m条交通路径，每条交通路径都是单行道。他已经预先规划好了一些点作为旅游的起点和终点，他想选择其中一个起点和一个终点，并找出从起点到终点的一条路线亲身体验浪的过程。但是他时间有限，所以想选择耗时最小的，你能告诉他最小的耗时是多少吗？In

1003: [ZJOI2006]物流运输Time Limit: 10 Sec  Memory Limit: 162 MBSubmit: 7989  Solved: 3333[Submit][Status][Discuss]Description　　物流公司要把一批货物从码头A运到码头B。由于货物量比较大，需要n天才能运完。货物运输过程中一般要转停好几个码头。物流公司通常

find the longest of the shortestTime Limit: 1000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3333    Accepted Submission(s): 1243Problem Descript

Problem DescriptionX is a fully prosperous country, especially known for its complicated transportation networks. But recently, for the sake of better controlling by the government, the president

1004. Sightseeing TripTime limit: 0.5 secondMemory limit: 64 MBThere is a travel agency in Adelton town on Zanzibar island. It has decided to offer its clients, besides many other attrac

最近写最短路遇到了差分约束问题，特此总结一下；          差分约束（1）求最大值，则不等式统一转化为（2）求最小值，则不等式统一转化为>=的形式，利用最长路，即可求出最小值；分析：利用最短路，即可求出最大值；>=时，图中存的每个边都是约束条件的最小值，故直接利用最长路，即可求出最小值；特殊情况：   A+B=C时，可在图中分别存入两个不等式A+B>=C与A+

宝物时间限制：1000 ms  |  内存限制：65535 KB难度：6描述传说HMH大沙漠中有一个迷宫，里面藏有许多宝物。迷宫里可能有N个藏宝地点，用1到N标记。藏宝地点之间最多有一条通路相连。标记1为迷宫的进出口。某天，Dr.Kong找到了迷宫的地图，他已经知道其中K（1Dr.Kong决定让他的机器人卡多去探险。卡多在经过某个藏宝地点时可能会拿走

B. Complete The Graphtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder has drawn an undirected

D. Fight Against Traffictime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle town Nsk consists of n junctions connected by m bidirectional roads....

Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11029    Accepted Submission(s): 3062Problem DescriptionTh

一个人的旅行Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 37547    Accepted Submission(s): 12781Problem Description虽然草儿是个路痴（就是在杭电待了一

Til the Cows Come HomeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 48638 Accepted: 16537DescriptionBessie is out in the field and wants to get back to the barn to get as much sleep as pos...

Silver Cow PartyTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 20559 Accepted: 9421DescriptionOne cow from each of N farms (1 ≤ N ≤ 1000) conveniently

Invitation CardsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3849    Accepted Submission(s): 1779Problem DescriptionIn the a

B. Bakerytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMasha wants to open her own bakery and bake muffi

1333: Funny Car RacingSubmit Page    Summary    Time Limit: 1 Sec     Memory Limit: 128 Mb     Submitted: 526     Solved: 125    DescriptionThere is a funny car racing in a city with

Wow! Such City!Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 1809    Accepted Submission(s): 610Problem DescriptionDoge, ti

ROADSTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 14776 Accepted: 5352DescriptionN cities named with numbers 1 ... N are connected with one-way roads. Each road has two parameters associa...

链接http://acm.codedream.ren/JudgeOnline/problem.php?cid=1002&pid=10题意：给你n个点，每个点都装一个wifi，wifi的半径为r，要让所有wifi连通；dis表示每个点到其他点的最小距离，dijkstra求最短路，然后在松弛后的dis中找最大值即为所求；#include #include #include#inclu

Wow! Such Conquering!Time Limit: 15000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1841    Accepted Submission(s): 535Problem DescriptionTher

Problem Description Binbin misses Sangsang so much. He wants to meet with Sangsang as soon as possible. Now Binbin downloads a map from ELGOOG.There are N (1<=N<=1,314) cities in the map ...