0x3f3f3f3f 第14页

P2260 [清华集训2012]模积和，P2834 能力测验（二维除法分块）

defineendl'\n'#definemid(l+r>>1)#definelsonrtpii;constdoublepi=acos(-1.0);constdoubleeps=1e-7;constintinf=0x3f3f3f3f

life丶happy·2020-08-07 10:27

浙大PAT甲级题目

31001PublicBikeManagement(30)思路看完题目就是最短路、数据范围N#definerep(i,l,r)for(inti=l;iVI;typedefvectorVVI;constintN=1e3+10;constintINF=0x3f3f3f3f

zhonglong_lin·2020-08-07 09:53

HDU 4370 0 or 1 (最短路）

showproblem.phProblemDescriptionGivenan/nmatrixCij(1#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f

weixin_30480583·2020-08-05 20:47

最短路dijkstra（注意判断重边）

cn.vjudge.net/problem/OpenJ_Bailian-2387#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f

房小二·2020-08-05 19:08

SPFA(最短路问题)

然后就是构造spfa函数；第一步：对dis[](用来存从源点到各顶点的最短距离)初始化为INF(一个很大的数例如0x3f3f3f3f),对vis[]数组初始化为零（表示未有点入队列）；构造一个队列queueQ

bokzmm·2020-08-05 18:55

最短路——Spfa算法

定义部分：constintMax=0x3f3f3f3f;intpoi_num,edge_num,cnt;structedge{//链式前向星的边结构体intv;intnex;intlen;}e[105]

御用铲屎官·2020-08-05 18:29

北理模拟与暴力

视频资料约瑟夫环#includeusingnamespacestd;typedeflonglongll;constintN=1e6+500;constintmod=10007;constintINF=0x3f3f3f3f

QXK_Jack·2020-08-05 17:13

【题解】[牛客OI周赛4-提高组]A.K小生成树枚举+前缀和+剪枝

题目链接#include#includeusingnamespacestd;constintN=1e6+10,Q=1e4+10,INF=0x3f3f3f3f;intn,m,a[N],fa[21],l,r

不进清北不改名·2020-08-05 16:20

Dijkstra最短路径算法优先队列优化版

模板参考kuangbin数据结构方面：constintINF=0x3f3f3f3f;constintmaxn=1000010;structqnode{intv;intc;qnode(int_v=0,int_c

shiyuKirito·2020-08-05 10:00

Floyd算法 + 路径记录

#include#includeusingnamespacestd;constintmaxn=100;constintinf=0x3f3f3f3f;intcost[maxn][maxn];intlowcost

XXunn·2020-08-05 03:21

free牛客暑假多校训练第四场 J（分层图求最短路板子）

解题思路：分层图求最短路板子AC代码：#include#definelllonglongusingnamespacestd;constintmaxn=1e3+10;constintinf=0x3f3f3f3f

长歌丶采薇·2020-08-05 03:16

2019牛客暑期多校训练营（第四场）J：free（分层图最短路裸题）

【代码】#includeusingnamespacestd;constintmaxn=1006;typedefpairP;constintinf=0x3f3f3f3f;intn,m,s,t,k;intd

芋圆西米露·2020-08-05 01:08

free（分层图最短路）（2019牛客暑期多校训练营（第四场））

题解：分层图最短路原题#includeusingnamespacestd;typedeflonglongintll;constintmaxn=1e5+10;constintINF=0x3f3f3f3f;

apple50052014·2020-08-05 00:25

最小生成树&次小生成树（并查集+贪心+暴力枚举）

#includeusingnamespacestd;constintL=1e5+7;constintinf=0x3f3f3f3f;constintmaxn=1000+7;intfather[maxn],

_-Y-_-Y-_·2020-08-04 21:06

【HDU】5994 Generator and Monitor【KD树】

typedeflonglongLL;#defineclr(a,x)memset(a,x,sizeofa)constintMAXN=200005;constintMAXM=10000005;constintINF=0x3f3f3f3f

poursoul·2020-08-04 19:14

最佳牛围栏二分+前缀和

include#include#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintMAX=0x3f3f3f3f

TzoZex·2020-08-04 17:26

Jessica's Reading Problem

来记录是否读过该书籍2.每次操作最后更新l和r#include#include#include#include#includeusingnamespacestd;constintN=1e6+10,INF=0x3f3f3f3f

TzoZex·2020-08-04 17:26

2018暑假集训楼下第十场（拓扑排序+dijkstra+floyd+Bellman ford）

例如,排序序列A,B,C,D意味着A#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;constintN=30;intmapp

拂袖秋波·2020-08-04 17:30

[kuangbin带你飞]专题十六 KMP & 扩展KMP

#includeusingnamespacestd;typedeflonglongLL;constintmaxn=1000005;constintmaxm=10005;constintinf=0x3f3f3f3f

Sega_hsj·2020-08-04 14:37

[kuangbin带你飞]专题六最小生成树（prim）（kruskal）（模板）

先贴prim算法的模板：#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;intedge[30][30],vis[30],

hi_just_do_it·2020-08-04 14:51

最小生成树

Prim#include#include#includeusingnamespacestd;constintmaxn=112;constintinf=0x3f3f3f3f;intdata[maxn][maxn

deerly_·2020-08-04 13:45

Codeforces Round #545 (Div. 2) ABCD 题解

include3#include4#include5#include6#include7#include8#include9#include10#include11#include12constintINF=0x3f3f3f3f

dashengchong6303·2020-08-04 13:38

poj1789Truck History 最小生成树水题

一个车牌到另一个车牌的产生权值是它们之间的数字不同的个数//问产生的最小的边权和//最小生成树#include#include#includeusingnamespacestd;constintmaxn=2010;constintinf=0x3f3f3f3f

ijbuhv·2020-08-04 13:56

Interesting Computer Game(DFS||并查集)

若无环贡献为顶点数，否则为顶点数减1.dfsdfsdfs做法#includeusingnamespacestd;typedeflonglongll;constintN=1e3+5,M=2e4+5,inf=0x3f3f3f3f

Harris-H·2020-08-04 10:44

EOJ Monthly 2020.7 Sponsored by TuSimple 部分题解

#includeconstintMaxN=0x3f3f3f3f;constintMinN=0xc0c0c00c;ty

昵称很长很长真是太好了·2020-08-04 08:43

E. 因数串

传送门#includeusingnamespacestd;typedeflonglongll;constintN=20,M=65,inf=0x3f3f3f3f,mod=1e9+7;#definemst(

Harris-H·2020-08-04 07:58

2017 ACM-ICPC 亚洲区（青岛赛区）网络赛 1009

#include#include#include#includeusingnamespacestd;typedeflonglongll;constdoubleeps=1e-6;constintINF=0x3f3f3f3f

Vincen??·2020-08-04 05:03

hdu3480(斜率dp)

，每段的代价为最大值减最小值的平方，为代价最小是多少代码1：#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f

Stayaccept·2020-08-04 01:12

2017年中南大学机试题（坑人oj）

include#include#include#include#include#include#includeusingnamespacestd;constintmaxn=1e5+50;constintinf=0x3f3f3f3f

DS_HY·2020-08-04 01:44

优先队列优化的迪杰斯特拉算法

include#include#include#include#include#include#includeusingnamespacestd;constintNI=100005;constintINF=0x3f3f3f3f

一名路过的小码农啊·2020-08-03 19:52

二分图最大匹配算法-Hopcroft-Karp模板

#include#includeconstintN=500,M=500,INF=0x3f3f3f3f;intdx[N],dy[M],sx[N],sy[M],p[N],q[N],a[N][M],l,r,n

清风小竹·2020-08-03 14:50

[2020年百度之星·程序设计大赛-初赛一]Coda的题解集

#includeconstintinf=0x3f3f3f3f;usingnamespacestd;intmain(){ios::sync_with_stdio(0);cin.tie(0)

Coda Limit Exceeded·2020-08-03 12:53

Poj-2421 Constructing Roads

Prim算法VSKruskal算法（感觉后者既好写，效率又高）Prim算法:#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f

zzti_xiaowei·2020-08-03 09:53

Command Network - POJ 3164 - 最小树形图

include#include#includeusingnamespacestd;#definemaxn107#definememset(a,b)memset(a,b,sizeof(a))constintINF=0x3f3f3f3f

LucienShui·2020-08-03 08:39

J.Pointer Analysis（模拟)

#includeusingnamespacestd;typedeflonglongll;constintN=26+5,M=205,inf=0x3f3f3f3f,mod=1e9+7;#definemst(

Harris-H·2020-08-03 08:40

P1396 营救(最小瓶颈路)

#includeusingnamespacestd;typedeflonglongll;constintN=1e4+5,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;#definemst

Harris-H·2020-08-03 08:39

Codeforces Round #601 (Div. 2）

AC代码：#includetypedeflonglongll;constintmaxx=10010;constintinf=0x3f3f3f3f;using

Stephencurry‘s csdn·2020-08-03 08:41

POJ 1861 最小生成树最大的边及记录

#include#include#include#include#include#include#includeconstintINF=0x3f3f3f3f;typedeflonglongLL;usingnames

小萨摩·2020-08-03 03:29

POJ - 1287 Networking prim算法

/**水题水题prim水过；以后再来写一波克鲁斯卡尔；并查集不是很溜；*/#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;constintmaxn

布呗之路·2020-08-03 00:22

POJ 3067 Japan（树状数组+贪心）

只有x1>x2&&y1#include#include#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;constintN

ナナ色のブランク·2020-08-02 22:11

POJ2349Arctic Network(最小生成树)

#include#include#include#include#includeusingnamespacestd;constintmaxn=505;constdoubleinf=0x3f3f3f3f;

Rain722·2020-08-02 22:44

F - Power Network POJ - 1459

#include#include#includeusingnamespacestd;constintN=105;constintinf=0x3f3f3f3f;intg[N][N];intflow[N][

h_lizeming·2020-08-02 21:08

Arctic Network POJ - 2349 Kruskal

条较大边剩下的取最大为答案AC代码#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2020-08-02 21:11

2020牛客多校（第四场）Finding the Order

include#include#include#includeusingnamespacestd;typedeflonglongll;typedefunsignedlonglongull;constintinf=0x3f3f3f3f

微寒゛·2020-08-02 20:23

POJ-1287(Networking) Prim

POJ-1287#include#include#include#includeusingnamespacestd;constintMAXN=60;constintINF=0x3f3f3f3f;intcost

YancyKahn·2020-08-02 20:36

POJ-1251(Jungle Roads) Kruskal

POJ-1251#include#include#include#includeusingnamespacestd;constintMAXN=30;constintINF=0x3f3f3f3f;intf