hdu1690

hdu1690

#include#include#includeusingnamespacestd;constlonglong_max=999999999999LL;//加LL要不然报数据太大；constintmaxn=111;longlongdist[maxn][maxn];//多个距离相加可能爆intinta[200];intn,m;intl1,l2,l3,l4,c1,c2,c3,c4;voidinint()
嘎达啊·2020-08-24 00:35

hdu1690 Bus System (dijkstra)

Problem Description Because of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s
·2015-11-13 13:49

hdu 1690最短路

不过打完之后一直WA，百思不得其解的情况下看了一下discuss，有人说得用long long，于是我马上改了交，果然过了……唉，以后看题还是得细心…… /* * hdu1690/win.cpp
·2015-11-11 10:23

hdu1690 Bus System（最短路 Dijkstra）

Problem Description Because of the huge population of China, public transportation is very important. Bus is an important transportation method in traditional public transportation system. And it’s
·2015-11-11 10:12

HDU1690 （Floyd）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1690 Wa了久，终于解决了，现在放出代码。 代码如下： #include <iostream>using namespace std; const long long INF = 99999999999LL;  //INF要开得非常大才可以过，一直Wa就因为这个原因con
·2015-10-31 15:42

HDU1690:Bus System(Floyd)

ProblemDescriptionBecauseofthehugepopulationofChina,publictransportationisveryimportant.Busisanimportanttransportationmethodintraditionalpublictransportationsystem.Andit’sstillplayinganimportantroleev
libin56842·2013-12-11 12:00

hdu1690 Bus System floyed最短路

hdu1690BusSystem  floyd中3个循环的顺序弄反了wa了一天== 正确顺序应该是先中间节点k，然后才是i,j。   #include usingnamespacestd; intINF=-1; __int64mp[110][110],location[110],N,M,L1,L2,L3,L4,C1,C2,C3,C4; intPrice(__int64x) { if(x<=L1
dellaserss·2012-07-14 15:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他