0x3f3f3f3f

nyoj 挑战密室 模拟题

include#include#include#include#include#include#includeusingnamespacestd;constintmaxn=1e3+10;constintINF=0x3f3f3f3f
dreamnyc·2017-04-19 16:59

第九届河南省ACM程序设计大赛 NYOJ 1274 信道安全

题意很清楚，本来想用最小生成树prim变形下，看到有超时的，节点数1#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f
一念执着_·2017-04-17 21:13

一次同余式的求解（扩展欧几里得）

include #include #include #include #defineLLlonglong usingnamespacestd; constintmaxn=4e6+10; constintinf=0x3f3f3f3f
acmer_zp·2017-04-14 16:08

最小费用最大流

对所有的u，v∈V，要求f(u,v)#include#include#include#include#includeusingnamespacestd;constintN=300;constintMAX=0x3f3f3f3f
E_ROAD_BY_U·2017-04-11 20:42

uestc oj 851方老师与素数

搜#include#include#include#include#include#includeusingnamespacestd;inta[10005];intvis[10005];intans=0x3f3f3f3f
YYyyCCCcccBb·2017-03-06 21:37

HDU 2066 一个人的旅行 spfa

#include#include#include#includeusingnamespacestd;constintMx=1010;constintinf=0x3f3f3f3f;intd
ProboxDu·2017-03-05 09:45

蓝桥杯 大臣的旅费（最短路）

代码：#include#include#include#include#includeusingnamespacestd;constintmaxn=1e4+5;constintINF=0x3f3f3f3f
cillyb·2017-02-28 22:38

Dijkstra_单源最短路径

includeusingnamespacestd;intgraph[210][210];//直接连边距离intdis[210];//源点到已知最短路径的距离boolvis[210];intsrc,ed,n,m;constintINF=0x3f3f3f3f
Gitfan·2017-02-24 21:16

poj 2396 Budget

include3#include4#include5#include6usingnamespacestd;7constintdian=305;8constintbian=10005;9constintINF=0x3f3f3f3f
dugudashen·2017-01-09 17:00

高斯消元（xor方程组）模板

#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;templateinlinevoid_read
Nocownowa·2016-12-14 19:38

SPOJ GCJ1C09C (区间dp)

#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintmaxn
Nicetomeetu-·2016-11-29 22:27

最小割最小割边

=所有点的权值和-最小割 #include//点即是边，拆点，拆边 #include #include usingnamespacestd; #defineLLlonglong constLLINF=0x3f3f3f3f
acmer_zp·2016-11-20 16:55

POJ 1947 Rebuilding Roads 题解【树形DP】

DescriptionThecowshavereconstructedFarmerJohn’sfarm,withitsNbarns(1#include#include#include#includeusingnamespacestd;constintmaxn=155,oo=0x3f3f3f3f
Chrissie_·2016-11-19 17:46

最小费用流

更新残留网络图直到找不到最短路为止 #include//最大费用权值取负值结果取负值 #include #include #include usingnamespacestd; constintinf=0x3f3f3f3f
acmer_zp·2016-11-12 22:53

ACM算法模板 · 一些常用的算法模板-模板合集（打比赛专用）

include#include#include#include#include#include#includeusingnamespacestd;constintmaxn=110;constintINF=0x3f3f3f3f
skyxiao007·2016-11-05 18:22

POJ 1681 Painter's Problem 高斯消元 枚举自由变量

#include#include#include#include#definesfscanf#definepfprintfusingnamespacestd;constintmaxn=400,INF=0x3f3f3f3f
SolarDomo·2016-11-04 18:08

POJ 1753 Flip Game 高斯消元 枚举自由变量

之后在位运算枚举自由变量的值代码：#include#include#include#definepfprintf#definesfscanfusingnamespacestd;constintmaxn=20,INF=0x3f3f3f3f
SolarDomo·2016-11-04 18:09

Hdu 4008 Parent and son(给你一棵树(n

题意:给你一棵树(nusingnamespacestd;constintN=1e5+100;constintINF=0x3f3f3f3f;structEdge{intto,next;}e[N*2];inttot
_zidaoziyan·2016-11-03 21:45

uva 12093 Protecting Zonk(在某个节点X使用A装置，此时与节点X相连的边都被覆盖)

题意:有一个n(n#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintN=1e5+100;structEdge
_zidaoziyan·2016-11-03 14:42

AOJ

include#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
zytjyh·2016-10-30 16:00

2016-2017 CT S03E06: Codeforces Trainings Season 3 Episode 6 The Baguette Master

的题意就是求外面一圈周长，直接可以求得#include usingnamespacestd; #definesz(X)((int)X.size()) typedeflonglongll; constintINF=0x3f3f3f3f
basasuya·2016-10-24 21:00

51nod 1068【简单博弈】

：A出2A胜；3：A只能出2的整数幂&&这个数#include#include#includeusingnamespacestd;typedeflonglongLL;constlonglongINF=0x3f3f3f3f
keyboarder_zsq·2016-10-23 19:53

prim及其:队列优化

prim://矩阵输入的prim有n*n的矩阵，求最小生成树#include#include#definespot1000constintinf=0x3f3f3f3f;inta[spot+10][spot
acmer_zp·2016-10-18 19:51

图论 网络流 HDU 1532 最大流

include#includeusingnamespacestd;constintMAXNODE=105*2;constintMAXEDGE=100005;typedefintType;constTypeINF=0x3f3f3f3f
再远不过PC·2016-10-13 00:03

【UVA11992】Fast Matrix Operations——二维线段树

#include usingnamespacestd; constintINF=0x3f3f3f3f; constintMAX=41000; structnod
huayunhualuo·2016-10-12 23:00

HDU 3790 又是一道最短路水题

写的时候要注意去重边的方式(通过长度来判断而不能通过花费）#includeusingnamespacestd;typedeflonglongLL;typedefunsignedlonglongULL;constintINF=0x3f3f3f3f
PosProteus·2016-10-12 15:56

UVA10735 混合图欧拉回路

include#include#include#include#include#include#includeusingnamespacestd;typedeflonglongLL;constintINF=0x3f3f3f3f
伟大的蚊子·2016-10-10 00:58

最长上升序列模板 LIS

include#include#include#include#includeusingnamespacestd;constintN=100010;typedeflonglongLL;constintinf=0x3f3f3f3f
zzuli-dk·2016-10-08 15:03

hdu5925 Coconuts

include usingnamespacestd; typedeflonglongll; #definesz(X)((int)X.size()) constintMAXN=505; constintINF=0x3f3f3f3f
basasuya·2016-10-06 21:00

UVA1515 pool ，玄学的最小割

includeusingnamespacestd;typedeflonglongLL;constintdx[]={0,0,-1,1};constintdy[]={-1,1,0,0};constintINF=0x3f3f3f3f
伟大的蚊子·2016-10-05 00:36

最短路水题

hdu1596求边权乘积的最大值，Dijkstra修改下松弛操作即可#includeusingnamespacestd;constintmaxn=1005;constintINF=0x3f3f3f3f;
PosProteus·2016-09-29 09:23

Vijos 1082 最短路

include#include#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f
Dan__ge·2016-09-13 20:17

vijos 1459 treap

include#include#include#includeusingnamespacestd;typedeflonglongll;typedefunsignedlonglongull;constintinf=0x3f3f3f3f
Dan__ge·2016-09-13 14:43

POJ（2503）（两种方法，二分，Map）

:4996)#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
zytjyh·2016-09-07 21:30

HDU 1055（贪心）

:4996)#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
zytjyh·2016-08-21 19:23

POJ 2437（贪心）

#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
zytjyh·2016-08-21 19:18

HDU 4405（概率dp）

(disable:4996)#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
zytjyh·2016-08-17 15:09

hdu 2888 二维线段树和二维ST模版

include#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
NLSQQ·2016-08-10 21:49

poj1065 Wooden Sticks(没有交集元素的lis的条数)

棍子有两个属性l和w，开启机器加工这些棍子，如果满足l1#include#include#includeusingnamespacestd;constintmaxn=5000;constintinf=0x3f3f3f3f
FightingForFinal·2016-07-30 18:52

lis算法（nlogn)

题目链接：点击打开链接代码：#include#include#includeusingnamespacestd;//intnum[10]={3,6,3,2,4,6,7,5,4,3};constintINF=0x3f3f3f3f
dongdongdong122·2016-07-23 22:10

POJ 1860 最短路

include#include#include#includeconstdoublePI=acos(-1.0);usingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f
Han_zhenyu·2016-07-23 10:57

【Hihocder 1329】——Splay

伸展树的插入，区间删除，区间查询,自己手残，debug了半天#include usingnamespacestd; constintINF=0x3f3f3f3f; typedefstructnode
huayunhualuo·2016-07-17 21:00

【BZOJ2055】80人环游世界【有上下界的最小费用最大流】

ThinkThankThunk*/#include#include#includeusingnamespacestd;constintmaxn=205,maxm=250005,maxq=100005,inf=0x3f3f3f3f
BraketBN·2016-07-16 17:52

HDU 5387 乱搞

include #include #include #include #include #include usingnamespacestd; typedeflonglongll; constintinf=0x3f3f3f3f
Dan__ge·2016-07-09 16:00

HDU 5384 AC自动机模版

自己处理一下就OK了#include #include #include #include #include usingnamespacestd; typedeflonglongll; constintinf=0x3f3f3f3f
Dan__ge·2016-07-09 15:00

HDU 5384 AC自动机模版

自己处理一下就OK了#include #include #include #include #include usingnamespacestd; typedeflonglongll; constintinf=0x3f3f3f3f
Dan__ge·2016-07-09 15:00

HDU 5349 乱搞

include #include #include usingnamespacestd; typedeflonglongll; typedefunsignedlonglongull; constintinf=0x3f3f3f3f
Dan__ge·2016-07-06 16:00

HDU 4819 二维线段树

(/□\)#include #include #include #include #include usingnamespacestd; typedeflonglongll; constintinf=0x3f3f3f3f
Dan__ge·2016-06-25 13:00

HDU 2255 KM模版题

include#include#include#includeusingnamespacestd;typedeflonglongll;typedefunsignedlonglongull;constintinf=0x3f3f3f3f
Dan__ge·2016-06-20 16:03

HDU 2255 KM模版题

include #include #include usingnamespacestd; typedeflonglongll; typedefunsignedlonglongull; constintinf=0x3f3f3f3f
Dan__ge·2016-06-20 16:00
上一页 20 21 22 23 24 25 26 27 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他