0x3f3f3f3f

愤怒的牛

题目描述思路思路#includeconstintinf=0x3f3f3f3f;intn,m,ans,L=inf,R=0,arr[100005];inlineintread(){ints=0,f=1;charch
dizong4589·2020-08-19 09:59

题解 洛谷P3431 【[POI2005]AUT-The Bus】

)表示(1#include#include#include#include#include#include#definelllonglongusingnamespacestd;constintINF=0x3f3f3f3f
dayi5680·2020-08-19 09:09

uva 10003 cutting sticks

#include#includeusingnamespacestd;intl,n;intp[60];intdp[60][60];constintinf=0x3f3f3f3f;voidsolve(){for
code_mlym·2020-08-19 09:00

最大生成树

defineppmake_pairusingnamespacestd;typedeflonglongLL;constintmaxn=1e6+30;constintN=260000;constLLmod=1e9+7;constintinf=0x3f3f3f3f
cj1064789374·2020-08-19 09:55

【小米oj】 括号配对

definemin(x,y)(x)=(a);i--)7#include8typedeflonglongll;9#definePIIpair10usingnamespacestd;11constintINF=0x3f3f3f3f
anshi1551·2020-08-19 08:18

线段树（单点修改，区间查询）

线段树模板*单点修改，区间查询*/#include#includeusingnamespacestd;typedeflonglongLL;constintMAXN=1e5+5;//constintINF=0x3f3f3f3f
algzjh·2020-08-19 08:36

洛谷p2698花盆

滑动窗口的好题从大到小算一次即可#include#include#include#include#includeusingnamespacestd;inthead=1,tail=1,j=2,minn=0X3f3f3f3f
abcjzx123·2020-08-19 08:17

（混合背包）洛谷P1833樱花

代码：#includeconstintN=1e4+10;constintmod=1e7+9;constintmaxn=0x3f3f3f3f;constintminn=0xc0c0c0c0;constintinf
会飞的小蛇·2020-08-19 08:17

codeforces 509C Sums of Digits (贪心对位操作)

include#include#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintoo=0x3f3f3f3f
My_ACM_Dream·2020-08-19 08:24

带权二分图匹配（KM模板）

include#include#include#include#include#include#includeusingnamespacestd;constintmaxn=505;constintINF=0x3f3f3f3f
Dunyb·2020-08-19 07:37

AcWing 274. 移动服务 (递推三种出边dp）

Lusingnamespacestd;typedeflonglongll;constllINF=0x3f3f3f3f;constintN=1e3+5;constintM=20
stormjing7·2020-08-19 07:25

(c++) str.erase() & str.find_first(last)_not_of()用法

includeusingnamespacestd;constintmaxn=5e4+100;#defineTLEios::sync_with_stdio(0),cin.tie(0)constintINF=0x3f3f3f3f
Spike Valentine·2020-08-19 07:00

【CCF 202006-1】线性分类器

includeusingnamespacestd;constintmaxn=5e4+100;#defineTLEios::sync_with_stdio(0),cin.tie(0)constintINF=0x3f3f3f3f
Spike Valentine·2020-08-19 07:30

【CCF 202006-2】稀疏向量

includeusingnamespacestd;constintmaxn=5e4+100;#defineTLEios::sync_with_stdio(0),cin.tie(0)constintINF=0x3f3f3f3f
Spike Valentine·2020-08-19 07:30

【CCF 201909-5】城市规划

includeusingnamespacestd;constintmaxn=5e4+100;#defineTLEios::sync_with_stdio(0),cin.tie(0)constintINF=0x3f3f3f3f
Spike Valentine·2020-08-19 07:29

HROJ 201802287 切木棒(优先队列)

LN（1usingnamespacestd;#definemem(a,b)memset(a,b,sizeof(a))typedeflonglongll;typedefpairP;constintINF=0x3f3f3f3f
Tony5t4rk·2020-08-19 06:04

poj1195二维树状数组+单点修改区间查询

id=1195最后减的时候注意一下还要加上被多减的部分#includeusingnamespacestd;typedeflonglongll;constintN=1e3+100;constintINF=0x3f3f3f3f
yyyan_·2020-08-19 06:59

POJ-2007-Scrambled Polygon

题目链接这道题就是极角排序判断叉积与0的大小关系#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
wjhshuai·2020-08-19 05:58

求二叉树的深度及每一个节点的深度

include#include#includeusingnamespacestd;structnode{charv;intnum;intdepth;structnode*ls,*rs;};intans=-0x3f3f3f3f
MARS·2020-08-18 21:40

二叉搜索树的插入，删除，和中序遍历

#include"bits/stdc++.h"usingnamespacestd;typedeflonglongLL;constintINF=0x3f3f3f3f;structBST{intvalue;
anzhi9859·2020-08-18 20:10

NOIp2015 信息传递

#include#includeconstintInf=0x3f3f3f3f;constintMaxN=2e5+5;intN,Index,Ans=Inf
weixin_30898109·2020-08-18 17:27

2018.11.02 洛谷P2661 信息传递（拓扑排序+搜索）

代码：#includeusingnamespacestd;constintN=2e5+5;intn,du[N],nxt[N],ans=0x3f3f3f3f;boolvis[N];inlineintdfs
weixin_30622107·2020-08-18 17:05

ural1005 Stone Pile (枚举)

includeusingnamespacestd;inta[25];intmain(){intn;scanf("%d",&n);for(inti=0;i0x3f3f3f3f
允雨琉·2020-08-18 16:45

数星星 Stars

include#include#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f
TzoZex·2020-08-18 16:54

loj#10078. 新年好(最短路)

12*12\)的数组，没有离散化，竟然过了，开到\(5050*5050\)就RE，玄学代码：#includeusingnamespacestd;constintN=1e6+10;constintINF=0x3f3f3f3f
dengjiao4915·2020-08-18 14:09

POJ-3237-Tree

代码：#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;constintmaxn=1e5+100;constintmaxm
南宮逸辰·2020-08-18 10:19

HDU -2425(BFS)

#includeusingnamespacestd;chara[21][21];intvis[21][21];constintinf=0x3f3f3f3f;structnode{intx,y,time;
‘’云腾致雨‘’·2020-08-18 09:51

洛谷-图的遍历-P2661-信息传递

#include#includeusingnamespacestd;constintN=200010;intn,fa[N],ans=0x3f3f3f3f;intget(intx,int&cnt){//cnt
Glaucous Big Devil·2020-08-18 09:41

hdu 4280(最大流ISAP)

要用堆栈加bfs优化#include#include#include#include#includeusingnamespacestd;constintmaxn=100000+10;constintinf=0x3f3f3f3f
严霜九月丶·2020-08-18 09:06

HDU-6070 Dirt Ratio（二分+线段树+分数规划）

：二分+线段树设sum为区间内不同数的个数，len为区间长度我们先二分答案得到k，那么我们需要在序列中找一段区间使得它的sum/len#definelsonl,m,rtPII;constintinf=0x3f3f3f3f
丿残念灬·2020-08-18 09:33

落谷P4728(最大二分匹配)

题解思路：我们把数组这些元素看成点然后两个点之间一条有向边的前提为iusingnamespacestd;constintmx=2e3+5;constintinf=0x3f3f3f3f;intdx[mx]
最菜的acmer·2020-08-18 08:04

hdu 4280

最大流ISAP，邻接表+GAP+当前弧优化//时间为3877ms#include#include#defineVM100010#defineEM400010constintinf=0x3f3f3f3f;
SprintfWater·2020-08-18 08:08

LCS模板_uva10405

-1)+1,a[i]=b[j];f(i,j)=max(f(i,j-1),f(i-1,j));#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
CY05627·2020-08-18 07:51

POJ-2677 Tour(双调欧几里得旅行商问题)(动态规划)

要求经过所有点的最短回路j#include#include#includeusingnamespacestd;constintN=1005;constdoubleINF=0x3f3f3f3f*1.0;structpoint
huatian5·2020-08-18 07:21

Codeforces Round #616 (Div. 1) C Prefix Enlightenment

带权并查集#include#defineLLlonglong#definePBpush_backusingnamespacestd;constintINF=0x3f3f3f3f;constintN=1e6
zhourenhao·2020-08-18 05:19

方格取数（HDU-1565） （状压DP）

Input包括多个测试实例，每个测试实例包括一个整数n和n*n个非负数(ntypedeflonglongll;constintmaxx=10010;constintinf=0x3f3f3f3f;usingnamespacestd
Stephencurry‘s csdn·2020-08-18 05:14

A Magic Lamp HDU - 3183

了整整一下午写个博客纪念一下/*线段树维护区间最小值贪心：每次找可行区域的最小值*/#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f
codediyi·2020-08-18 05:50

Dijkstra算法（最短路；例题HDU2112）

主要步骤：1.定义一个dis数组记录起始点到每个点的距离，初始化时不能到达的记为inf(一般用0x3f3f3f3f)。
weixin_30823227·2020-08-18 04:29

tyvj 1266 费解的开关

代码#include#include#includeusingnamespacestd;constintMAXN=15;constintinf=0x3f3f3f3f;intn,a[MAXN][MAXN]
weixin_30512043·2020-08-18 04:33

Codeforces Round #587 C E1 F题解

#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;consti
几许情愁·2020-08-18 01:28

CCP-CSP认证考试 201803-1 跳一跳 c/c++题解

CCF-CSP认证考试题解目录By东瓜lqd题目描述:代码:#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;constllINF
东瓜lqd·2020-08-18 01:13

tyvj 1266 费解的开关

代码#include#include#includeusingnamespacestd;constintMAXN=15;constintinf=0x3f3f3f3f;intn,a[MAXN][MAXN]
妖怪吧·2020-08-18 01:47

poj2749 2-SAT

include#include#include#include#include#include#include#include#include#include#definenlnP;constintINF=0x3f3f3f3f
Phoenix丶HN·2020-08-18 00:50

开多个链表操作

include#include#include#include#include#include#include#include#include#include#definenlnP;constintINF=0x3f3f3f3f
Phoenix丶HN·2020-08-18 00:50

小猫爬山（深度搜索）

经历了千辛万苦，小猫们终于爬上了山顶，但是疲倦的它们再也不想徒步走下山了（呜咕>_usingnamespacestd;ints[20];intb[20];intn,m;intans=0x3f3f3f3f
mrgaohaihang·2020-08-18 00:14

UVALive 4960 Sensor network（MST+LCA）

16412【题意】给了N#include#include#includeusingnamespacestd;constintmaxn=355;constintmaxm=100010;constintinf=0x3f3f3f3f
just_sort·2020-08-17 23:37

数据结构OJ作业——最小生成树

id=2485最小生成树输出最大边权#include#include#includeusingnamespacestd;constintMAXN=510;constintINF=0x3f3f3f3f;intmap
nnbs·2020-08-17 23:22

Bellman无向图

include#include#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
Reversing·2020-08-17 22:10

UVA 10817 Headmaster's Headache——dp

刷表状压，没什么特别的#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintmaxn=(1=INF
hao_zong_yin·2020-08-17 22:58

C - Basketball Exercise

注意状态转移方程，0是取第一行，1是取第二行#include#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f
只有魔法才能对抗魔法·2020-08-17 22:57
上一页 6 7 8 9 10 11 12 13 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他