_nplus

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

WormholesTime Limit:2000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64uDescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes

Shortest PathTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3769    Accepted Submission(s): 890Problem DescriptionWhen YY was a

FDNY to the Rescue!Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2368 Accepted: 721DescriptionThe Fire Department of New York (FDNY) has always been p

Currency ExchangeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18686 Accepted: 6656DescriptionSeveral currency exchange points are working in our city

Idiomatic Phrases GameTime Limit: 2 Seconds      Memory Limit: 65536 KBTom is playing a game called Idiomatic Phrases Game. An idiom consists of several Chinese characters and has a certain me

昂贵的聘礼Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 35560 Accepted: 10171Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给

解题报告题意：N个路灯，1,2,3,分别表示图书馆

解题报告题目传送门题意：有N个点，点1为珍贵矿物的采矿区， 点N为加工厂，有M条双向连通的边连接这些点。走每条边的运输容量为C，运送时间为D。他们要选择一条从1到N的路径运输， 这条路径的运输总时间要在T之内，在这个前提之下，要让这条路径的运输容量尽可能地大。一条路径的运输容量取决与这条路径中的运输容量最小的那条边。思路：二分容量建图，spfa判时间是否符合

解题报告求最长路。用SPFA求最长路，初始化图为零，dis数组也为零#include #include #include #include #include #define inf 99999999#define N 110using namespace std;int mmap[N][N],dis[N],vis[N],n;void spfa(int s){

Domino EffectTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8224 Accepted: 2068DescriptionDid you know that you can use domino bones for other things b

畅通工程续Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23022    Accepted Submission(s): 8085Problem Description某省自从实行了很多年的畅通工程计划后，