0x3f3f3f3f

2018 Multi-University Training Contest 10 hdu 6432 Problem G. Cyclic(oeis题)

https://oeis.org/A000757#includeusingnamespacestd;#definelllonglongconstintmaxn=1e5+10;constintinf=0x3f3f3f3f
threeh20·2020-08-24 23:14

hdu3605(网络流+状态压缩)

点击打开链接题意：判断二分图匹配左部的点个数为n，右部的点的个数为m，判断左部是否都能匹配(1#include#include#include#include#include#includeconstintINF=0x3f3f3f3f
Stayaccept·2020-08-24 23:58

hash(整数哈希)

#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;llmod[10]={1000019,1000079,1000103,1000121,1000139,1000141,1000169,1000189,1000
qq_43312551·2020-08-24 22:29

POJ 3276-Face The Right Way （开关问题）

#include#includeusingnamespacestd;constintmaxn=5005;intn,ans_k,ans_m=0x3f3f3f3f;intan[maxn];intff[maxn
Z.rush·2020-08-24 22:28

信息学奥赛一本通 1130：找第一个只出现一次的字符（桶排）

include#include#include#includeusingnamespacestd;typedeflonglongll;constintMOD=10000007;constintINF=0x3f3f3f3f
WA-Accepted·2020-08-24 22:27

CCPC2018 吉林站 C.JUSTICE(思路+分数结构体加法)

如果不能，输出NO数据规模1usingnamespacestd;typedeflonglongll;constintmaxn=100010;constdoubleeps=1e-8;constintINF=0x3f3f3f3f
krypton12138·2020-08-24 22:59

ACM-ICPC 2015 Changchun Preliminary Contest E.Travel(排序+并查集)

usingnamespacestd;typedeflonglongll;typedefunsignedlonglongull;staticconstintmaxn=100010;staticconstintINF=0x3f3f3f3f
krypton12138·2020-08-24 22:59

TsinsenA1393. Palisection （回文树）

include#include#includeusingnamespacestd;typedeflonglongll;constlllinf=0x3f3f3f3f3f3f3f3f;constintinf=0x3f3f3f3f
hcx11333·2020-08-24 22:24

Gym - 101606L Lizard Lounge——LIS

累加起来就是结果#include#include#include#include#include#includeusingnamespacestd;constintmaxn=1e6+10;constintINF=0x3f3f3f3f
hao_zong_yin·2020-08-24 22:50

hdu 4513

#includeusingnamespacestd;constintmaxn=200005;constintinf=0x3f3f3f3f;voidmanacher(constint*str,int*r,
职业砖瓦匠·2020-08-24 21:49

dp基础-1 A - Max Sum Plus Plus HDU - 1024

include#include#include#include#includeusingnamespacestd;//A求指定段数的最大字段和constintmmax=600100;constintinf=0x3f3f3f3f
axuhongbo·2020-08-24 21:17

hdu 4513 吉哥系列故事――完美队形II (Manacher)

include#include#include#include#include#include#includeusingnamespacestd;//typedeflonglonglld;constintoo=0x3f3f3f3f
My_ACM_Dream·2020-08-24 21:37

HDU - 4513 吉哥系列故事――完美队形II(manacher)

中文题了解题思路：manacher的裸题，只要再加相等和大小判断就可以#include#include#includeusingnamespacestd;constintN=200010;constintINF=0x3f3f3f3f
暗金色·2020-08-24 21:53

BZOJ 1588 Treap模版题

的值与当前值的绝对值之差的最小值，加起来最后输出即可#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f
Dan__ge·2020-08-24 21:00

A - Max Sum Plus Plus HDU - 1024——基础dp

部分的最大值状态转移方程dp[i][j]=max(dp[i][j-1]+a[j],max(dp[i-1][k])+a[j]),0#include#includeusingnamespacestd;constintinf=0x3f3f3f3f
leoxry·2020-08-24 21:21

HDU 4009 Transfer water

includeusingnamespacestd;intn,X,Y,Z;structnode{intx,y,z;}vill[1200];constintMAXM=40010;constintMAXN=1010;constintINF=0x3f3f3f3f
xiaoyulunUSC·2020-08-24 21:37

Floyd 判断最小环

模板：#include#include#includeconstintINF=0x3f3f3f3f;usingnamespacestd;constintMAXN=105;intdis[MAXN][MAXN
邵光亮·2020-08-24 15:59

Floyd算法+Bellman-ford 算法+SPFA算法

[i][j]=cost[i][k]+cost[k][j];}}}完整代码//floyd//复杂度O(N^2)#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
han_hhh·2020-08-24 14:19

HDU 2554 典型最短路问题 dijkstra&floyd

每组数据第一行是两个整数N、M（N#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;
luer9·2020-08-24 12:40

Codeforces Round #643 (Div. 2) A~E题题解

includeusingnamespacestd;#defineintlonglong#definemem(a)memset(a,0,sizeof(a))#definelb(x)(x&(-x))constintinf=0x3f3f3f3f
取个什么名字比较好·2020-08-24 11:44

Codeforces Round #629 (Div. 3) Editorial E. Tree Queries

details/105132814#include#include#include#include#includeusingnamespacestd;#definelllonglongconstintinf=0x3f3f3f3f
wtcl·2020-08-24 11:38

Codeforces Round #609 (Div. 2）

AC代码：#includetypedeflonglongll;constintmaxx=10010;constintinf=0x3f3f3f3f;usingnamespacestd;intmain(){
Stephencurry‘s csdn·2020-08-24 11:36

考前错误总结

（0x3f3f3f3f其实很小的）3.eps不能设为int，那就是0了啊4.计算内存空间5.变量名冲突6.输出输入与定义不符记得开-Wall-Wextra7.调试语句是否删完了8.文件名是否打错直接复制
Faithfully__xly·2020-08-24 11:06

Codeforces Round #643 (Div. 2) D. Game With Array (思维，贪心)

defineNewNode(TreeNode*)malloc(sizeof(TreeNode))#defineMem(a,b)memset(a,b,sizeof(a))constintN=5e5+5;constintINF=0x3f3f3f3f
要无愧于人·2020-08-24 09:20

最短路练习一（水题）

Floyd解决）HDU2544（Floyd解决）HDU1548（Floyd解决）HDU1874（Floyd解决）#include#includeusingnamespacestd;constintinf=0x3f3f3f3f
伊莎贝拉•狗剩·2020-08-24 09:57

省选专练[TJOI2013]循环格

神仙网络流QAQ这个主要还是没想通环是啥：图中全是入读出度为1的点所以用费用流表示改变方向#includeusingnamespacestd;constintN=1e5+10;constintINF=0x3f3f3f3f
dingwufu9301·2020-08-24 08:23

Codeforces Round #Pi (Div. 2) （ABCD）

mycode#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintN=1e5+10;intn;
HelloWorld10086·2020-08-24 07:10

Codeforces Round #623

A.DeadPixel题目链接#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;constintmaxn=1e9;inta
so vegetable I am·2020-08-24 07:05

【学习笔记】动态规划

(t--)usingnamespacestd;typedeflonglongll;typedefunsignedlonglongull;constintmaxn=2e5+10;constintINF=0x3f3f3f3f
hcCuriosity·2020-08-24 07:41

2020/4/21每日一练

质因数分解数学题传送门题意就是给出一个长度为nusingnamespacestd;typedeflonglongll;typedefpairpii;typedefpairpll;constintmaxn=1e5+5;constllinf=0x3f3f3f3f
blue bear·2020-08-24 07:24

NOI2019 回家路线 DP

f[i][j]第i个点，时间为j，暴力转移复杂度O(m*t),好像正解是斜率优化，出题人太不小心了233代码#includeusingnamespacestd;constintN=2e5+7,INF=0x3f3f3f3f
复杂的哈皮狗·2020-08-24 06:47

HDU-1213 并查集裸题

include#include#includeusingnamespacestd;typedeflonglongll;#defineDEBUGconstintmaxn=110000+5,maxv=26,INF=0x3f3f3f3f
j_d_m_y·2020-08-24 00:52

求直线ax+by+c=0 上有多少个整点(x,y)满足x∈[-100,100],y∈[-100,100]

include#include#includeusingnamespacestd;typedeflonglongll;#defineDEBUGconstintmaxn=1000+5,maxv=26,INF=0x3f3f3f3f
j_d_m_y·2020-08-24 00:52

HDU-2203 kmp水一发

include#include#includeusingnamespacestd;typedeflonglongll;#defineDEBUGconstintmaxn=110000+5,maxv=26,INF=0x3f3f3f3f
j_d_m_y·2020-08-24 00:52

洛谷 P2706 巧克力 题解

题目链接：link这题很容易想出来把所有0设为-inf(inf=0x3f3f3f3f)，之后求最大子矩阵和。
user_qym·2020-08-23 19:43

poj3666(dp前缀优化)

+|AN-BN|，输出最小代价代码：#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
Stayaccept·2020-08-23 19:08

HDU3666--差分约束

思路：根据题意可得，Lusingnamespacestd;constintN=805;constintINF=0x3f3f3f3f;intn,m,L,U;inthead[N],tot;doubledis
Robis123·2020-08-23 06:49

木板切割问题（二）——动态规划

一、问题引入有一根长度为L(L2#include3#include4#include5usingnamespacestd;67constintINF=0x3f3f3f3f;8constintmaxl=1000
dianshu1593·2020-08-23 05:30

蓝桥杯-方格填数-快速排序-消除尾一-寒假作业-剪邮票-四平方和

1题暴力72题找规律263题DFS深度优先搜索注意检查是否可以继续搜答案1580#include#include#includeconstintN=23,undefined=0x3f3f3f3f;intp
wjsay·2020-08-23 05:11

【BZOJ1609】[Usaco2008 Feb]Eating Together麻烦的聚餐【最长不下降子序列】

/*FootprintsInTheBloodSoakedSnow*/#include#includeusingnamespacestd;constintmaxn=30005,inf=0x3f3f3f3f
BraketBN·2020-08-23 04:05

D. Maximum Distributed Tree(DFS)

#includeusingnamespacestd;typedeflonglongll;constintN=1e5+5,M=6e4+5,inf=0x3f3f3f3f,mod=1e9+7;
Harris-H·2020-08-23 04:33

zoj3469(区间dp)

和送餐行走一公里需要的时间，问送完n个客人的外卖最小愤怒值代码：#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
Stayaccept·2020-08-23 02:23

洛谷 P3955 图书管理员【17NOIP普及组】

include#include#include#includeusingnamespacestd;typedeflonglongll;constintMOD=10000007;constintINF=0x3f3f3f3f
WA-Accepted·2020-08-23 02:42

HDU1074 Doing Homework(写作业的顺序改变使失分最少 基础状压dp+记录路径)

题目#include#definelow(x)((x)&(-x))usingnamespacestd;constintN=16,INF=0x3f3f3f3f;chars[N][105];intd[N],
Helium_wild·2020-08-23 02:09

洛谷2157 学校食堂（状压DP）

【代码~】#includeusingnamespacestd;constintMAXN=1e3+10;constintINF=0x3f3f3f3f;intT;intn,ans;int
Michael_GLF·2020-08-23 01:32

uva-11987 Almost Union-Find （并查集）

移动到q所在的集合"3p"：询问p所在集合的元素个数及元素和总共m个操作，1#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f
Vace___yun·2020-08-23 01:14

完全背包+记录路径

#include#include#includeusingnamespacestd;constintmaxn=12;constintmaxv=2000+5;constintINF=0x3f3f3f3f;
Falling～·2020-08-23 00:25

程序员的背包 ZZULIOJ - 2485 离散化 dp lis | 树状数组

题解经典的最长上升子序列问题数值过大使用离散化处理数值过多使用二分优化dpAC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f
CaprYang·2020-08-23 00:22

uva11478（spfa求负环）

到最后你会发现总和没变，在这里我想说每个顶点所连的边加减的数值随意，可以不相等#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
银之夏雪·2020-08-23 00:42

poj3522求一棵生成树使最大的边和最小的边差值最小

若不连通，输出-1,反之，输出差值*/#include#include#defineN100usingnamespacestd;constintinf=0x3f3f3f3f;typedefstructnote
yuanba_xs·2020-08-23 00:31
上一页 4 5 6 7 8 9 10 11 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他