0x3f3f3f3f

2020训练赛2

题目C二维dp：#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f
ACMer_lld·2020-08-10 20:18

Leetcode 1021 Best Sightseeing Pair

andtwosightseeingspotsiandjhavedistancej-ibetweenthem.Thescoreofapair(i&num){intlen=num.size();intmaxx=-0x3f3f3f3f
shyoldman·2020-08-10 19:59

floyd算法

0;kmap=newTreeMap<>();int[][]dp=newint[250][250];for(inti=0;i<250;i++)for(intj=0;j<250;j++)dp[i][j]=0x3f3f3f3f
数学家是我理想·2020-08-10 19:07

HDU 5401(计数dp)

include#include#include#include#include#include#include#definelsrtpii;typedeflonglongll;constintinf=0x3f3f3f3f
playwfun·2020-08-10 18:30

HDU 2544（最短路模板题——dijkstra）

*;publicclassMain{staticfinalintN=1050;staticfinalintINF=0x3f3f3f3f;staticintu,v,w
ABq·2020-08-10 18:05

HDU 1869（最短路模板——ployd）

*;publicclassMain{staticintm,n,u,v,w;staticfinalintN=150;staticfinalintINF=0x3f3f3f3f;staticlong[][
ABq·2020-08-10 18:05

POJ1001 Exponentiation(高精度幂)

#includeusingnamespacestd;#include#includeconstintinf=0x3f3f3f3f;
mymilkbottles·2020-08-10 18:00

状压dp练习

#include#include#include#include#includeusingnamespacestd;#defineDEBUGconstintmaxn=12+5,maxv=26,INF=0x3f3f3f3f
j_d_m_y·2020-08-10 17:46

网络流最大流板子+一点理解+费用流

二分图最小点权覆盖权值和dc+弧优化#include#include#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f
只有魔法才能对抗魔法·2020-08-10 16:27

最小费用最大流的模板spfa

include#include#include#includeusingnamespacestd;constintmaxn=100005;constintmaxm=1000500;constintinf=0x3f3f3f3f
hehedad·2020-08-10 15:30

Tarjan求强联通分量

对每一个点以其为终点的最大值第二种：dfs记忆化搜索，对每一个点以其为起点的最大值显然第二种更简单易写dfs记忆化搜索#includeusingnamespacestd;constintmaxn=1e5+5;constintINF=0x3f3f3f3f
auiayo82822·2020-08-10 15:23

最小费用最大流

SPFA#includeusingnamespacestd;constintMAXN=1000;constintMAXM=10000;constintINF=0x3f3f3f3f;structEdge{
algzjh·2020-08-10 15:54

Dijkstra算法+堆优化（模板）

vectorE[MAXN]进行初始化后加边*/#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
algzjh·2020-08-10 15:54

Dijkstra模板[kuangbin]

#includeusingnamespacestd;/**使用优先队列优化Dijkstra算法*复杂度O(ElogE)*注意对vectorE[MAXN]进行初始化后加边*/constintINF=0x3f3f3f3f
Carlton.K.T·2020-08-10 15:02

最小费用最大流模板

刘汝佳的MCMF模板：队列优化的BellmanFord（SPFA）版：#includeusingnamespacestd;constintMAXN=1e5+5;constintINF=0x3f3f3f3f
张松超·2020-08-10 15:21

dijkstra队列优化链式前向星(C++、Java)

include#include#include#includeusingnamespacestd;constintmaxm=4010;//边constintmaxn=1010;//点constintinf=0x3f3f3f3f
FlyuZ·2020-08-10 15:11

（贪心）洛谷P1233木棍加工

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

树状数组求最长上升子序列

1)其中1#includeusingnamespacestd;#defineFOR(i,a,b)for(inti=(a);i#includeusingnamespacestd;constintinf=0x3f3f3f3f
SH16666·2020-08-10 14:45

牛客小白月赛22

货物种类思路：差分数组L用来记入该种类的货物R用来减去该种类的货物复杂度O(n)参考Max_n#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f
陆小萌·2020-08-10 14:29

P2392 kkksc03考前临时抱佛脚(洛谷 数据型DFS)

#includeusingnamespacestd;constintN=50;constintINF=0x3f3f3f3f;ints1,s2,s3,s4;intl,r,ans,minn;intwork[
Cyber苦行者·2020-08-10 14:26

HDU 4513 Manacher小小变形

模版找中间时候的条件就可以水过了，下面还有解释#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f
Dan__ge·2020-08-10 13:34

最小费用最大流模板

#include#include#include#includeusingnamespacestd;constintMAXN=1000;constintMAXE=100000;constintINF=0x3f3f3f3f
sdau_blue·2020-08-10 13:54

最小费用最大流 模版

点的总数为N，点的编号0~N-1constintMAXN=10000;constintMAXM=100000;constintINF=0x3f3f3f3f;structEdge{intto,next,cap
wzazzy·2020-08-10 13:22

DijKstra算法普通+堆优化链式向前星

朴素版本#includeusingnamespacestd;constintmaxn=10010;constintinf=0x3f3f3f3f;inta[maxn][maxn],dis[maxn],visit
life丶happy·2020-08-10 13:07

邻接表Dijkstra（求最短路径）

板子板子，学长给的#includeusingnamespacestd;constintN=1100;constintinf=0x3f3f3f3f;boolvis[N];intdis[N];intn;vector
看身后·2020-08-10 13:34

dijkstra 加上堆优化及两种存储图的方法

首先附上vector的代码：#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;intn,m;i
我的算法世界·2020-08-10 13:12

线段树动态维护区间最大子段和

constintM=5e4+10;constintinf=0x3f3f3f3f;structnode{intl,r;intmxl,mxr,mx,sum;intmid(){return(l+r)>>1;}
ANDX·2020-08-10 13:40

最小费用最大流（Bellman-Ford找增广路）

includeusingnamespacestd;typedeflonglongLL;constintMAXN=1e3+50;//点数的最大值constintMAXM=4e5+50;//边数的最大值constintINF=0x3f3f3f3f
algzjh·2020-08-10 12:41

[最小费用最大流(板子)]

1typedeflonglongll;2constllinf=0x3f3f3f3f;3structedge{4intx;5inty;6llv;//流量7llc;//费用8intnex;9}e[1005]
aiyuneng5167·2020-08-10 12:41

洛谷OJ: P1091 合唱队形(LIS)

*题型:DP**/#include#includeusingnamespacestd;constintmaxn=100+10;intdp1[maxn],dp2[maxn],a[maxn],n,ans=0x3f3f3f3f
大隐于市_·2020-08-10 12:34

POJ 2387 Til the Cows Come Home（spfa）

#include#include#include#include#include#includeusingnamespacestd;constintmaxn=1010;constintinf=0x3f3f3f3f
BellWind1995·2020-08-10 10:25

POJ3268 Silver Cow Party spfa求解 最短路

#include#include#include#include#include#includeconstintINF=0x3f3f3f3f;typedeflonglongLL;usingnamespa
小萨摩·2020-08-10 10:57

矩阵快速幂（构造）

contest/221/C构造矩阵#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
wwwlps·2020-08-10 08:55

Codeforces Round #590 (Div. 3) 题解

#include#definelllonglong#defineullunsignedlonglongusingnamespacestd;constintINF=0x3f3f3f3f;intmain()
forOnward·2020-08-10 03:54

P2036 Perket

，所以可以直接暴力，不过这道题的正解是dfs#includeusingnamespacestd;constintmaxn=15;structnode{intx,y;}s[maxn];intn,sum=0x3f3f3f3f
Dream-chasing ant·2020-08-10 00:05

补题测验

E.cf1260D这个写法我还是不理解先记下来#includeconstintmaxn=0x3f3f3f3f;constint
我是力量的化身·2020-08-09 22:17

Codeforces Round #534 (Div. 2)（补题:ABC）

问如何分可以使得分出来的各个数之间的差值尽可能小直接输出n个1就符合题意#includeusingnamespacestd;typedeflonglongll;constintN=2e3+100;constintINF=0x3f3f3f3f
yyyan_·2020-08-09 19:32

Leetcode 54. 螺旋矩阵

模拟螺旋的路线，标记已访问的数据，然后循环即可classSolution{public:intdx[4]={0,1,0,-1},dy[4]={1,0,-1,0},f=0;constintinf=0x3f3f3f3f
Bendaai·2020-08-09 17:40

P2770 航空路线问题

#include#include#include#include#include#include#includeusingnamespacestd;constintN=2150,oo=0x3f3f3f3f
同学课堂·2020-08-09 16:26

Codeforce 632E(背包变形)

求恰好选择k次所有价值的情况代码：#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f
Stayaccept·2020-08-09 12:31

2019 ICPC 南昌现场赛 重现（部分）

A.Attackpoj3123板子题斯坦纳树板子如下constintmaxm=2009;constintmaxn=39;constintinf=0x3f3f3f3f;structEdge{intv,w,
ZHXU1998·2020-08-09 11:51

E. Divisibility by 25 （暴力）

(false);cin.tie(NULL);cout.tie(NULL);usingnamespacestd;typedeflonglongLL;typedefpairPII;constintINF=0x3f3f3f3f
凝望_XXW·2020-08-09 11:36

关于dijkstra的优化 及 多源最短路

其中22#include3#include4#include5usingnamespacestd;6constintN=105;7constintM=10010*2;8constintinf=0x3f3f3f3f
dengpangbu3703·2020-08-09 07:09

Codeforces Round #Pi (Div. 2)(A,B,C,D)

include#include#include#include#include#include#includeusingnamespacestd;typedeflonglongLL;constintinf=0x3f3f3f3f
Rocky0429·2020-08-08 22:26

bzoj 1576（dijkstra+并查集）

#includeusingnamespacestd;constintmaxn=1e5+2,maxm=2e5+2,INF=0x3f3f3f3f;intn,m;inthead[maxn],dis[maxn]
嘉伟森的猫·2020-08-08 12:31

Tree Generator™ CodeForces - 1149C (线段树,括号序列)

defineREP(i,a,n)for(inti=a;i>1)#definelslc,l,mid#definersrc,mid+1,rusingnamespacestd;constintN=3e5+10,INF=0x3f3f3f3f
weixin_30673611·2020-08-08 02:21

bzoj 1196

definefifirst#definesesecond#definemkmake_pair#definepiipairusingnamespacestd;constintN=1e5+7;constintinf=0x3f3f3f3f
afd5154·2020-08-08 01:57

bzoj 1102

definemkmake_pair#definepiipair#definepiiipair>usingnamespacestd;constintN=1000+10;constintM=10+7;constintinf=0x3f3f3f3f
afd5154·2020-08-08 01:26

bzoj 1109

definefifirst#definesesecond#definemkmake_pair#definepiipairusingnamespacestd;constintN=2e5+7;constintinf=0x3f3f3f3f
afd5154·2020-08-08 01:26

最小生成树【模板】

includeusingnamespacestd;constintmaxn=1005;intn;intd[maxn],vis[maxn],mat[maxn][maxn];intmain(){intEnd,ans=0;memset(d,0x3f3f3f3f
小燃、·2020-08-08 00:00
上一页 9 10 11 12 13 14 15 16 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他