0x3f3f3f3f 第2页

LeetCode 45

classSolution{public:intjump(vector&nums){constintN=1e4+10;intdp[N]={0};for(inti=1;i0x3f3f3f3f

心瘾こころ·2024-01-05 18:33

dijkstra➕dfs回溯 | 1018 Public Bike Management （30 point(s)

注意点是从0到nn的冷静冷静再写一次吧233333先次饭饭嘻嘻#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f

电车上那个cll呀·2023-12-22 12:43

HLPP 最大流 O(V^3)

\*==================================================*/#definetypefint//typeofflowconsttypefinf=0x3f3f3f3f

千秋TʌT·2023-12-17 12:52

Day57力扣打卡

classSolution:defminimumEffortPath(self,heights:List[List[int]])->int:n,m=len(heights),len(heights[0])dist=[0]+[0x3f3f3f3f

功德箱我每年都投·2023-12-15 13:46

The 2021 CCPC Weihai Onsite ADGJM

思路首先，根的度数必须3的点#include#defineintlonglongconstexprintN=1e6+10;constexprintmod=998244353;constexprintInf=0x3f3f3f3f

lamentropetion·2023-12-14 18:01

算法设计与分析第五章作业

includeusingnamespacestd;constintN=1010;intn,m,d;intw[N][N],c[N][N];intx[N],bestx[N];intcw,cm;intbestw=0x3f3f3f3f

令夏二十三·2023-12-07 01:03

蓝桥杯ACwing习题

www.acwing.com/problem/content/description/1030/#include#include#includeusingnamespacestd;constintN=510,INF=0x3f3f3f3f

wyn66666·2023-12-06 06:20

POJ 3411 Paid Roads 状态压缩DP（旅行商问题）

一、题目大意有m条单向边连接了N个城市（1usingnamespacestd;constintMAX_N=10,INF=0x3f3f3f3f;intdp[1>i&1){costVU=min(costVU

希望能够帮到你！·2023-12-03 22:38

最短路问题

单源最短路Dijkstra算法力扣743.网络延迟时间constintN=7777;intINF=0x3f3f3f3f;classSolution{structedge{intv,w;};vectore

天穹南都·2023-12-03 17:46

[传智杯 #3 决赛] 序列

输入输出样例输入#15512345输出#14#include#defineendl'\n'#defineintlonglongusingnamespacestd;constexprintN=1e5+10,inf=0x3f3f3f3f

ou_fan·2023-12-03 04:47

P8833 [传智杯 #3 决赛] 课程

#1551234513456输出#14#include#defineendl'\n'#defineintlonglongusingnamespacestd;constexprintN=1e5,inf=0x3f3f3f3f

ou_fan·2023-12-03 04:17

ac自动机（字典树和kmp的延伸）（待更新）

（hdu2222）#include#pragmaGCCoptimize(2)usingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;constintmaxn

蒲公英之殇·2023-11-29 21:12

基础莫队模板

definelbt(x)(x)&(-x)#definerep(i,n)for(inti=0;iPII;typedefdoubledb;constintN=5e4+10,mod=998244353,inf=0x3f3f3f3f

布克波波·2023-11-28 16:00

CodeTON Round 5 (Div. 1 + Div. 2, Rated, Prizes!) F. Tenzing and Tree(绝对值等式+树的重心性质+贡献)

题目n(n#include#include#include#include#include#includeusingnamespacestd;constintN=5e3+10,INF=0x3f3f3f3f

Code92007·2023-11-26 16:40

L2-001. 紧急救援 dijkstra，适合模版

#includeusingnamespacestd;constintmaxn=505;constintINF=0x3f3f3f3f;intn,m,st,ed;intG[maxn][maxn];//城市与城市之间的距离

西瓜不甜不甜不甜·2023-11-25 23:01

《Leetcode每日一题》488.祖玛游戏

classSolution{public:staticconstexprintINF=0x3f3f3f3f;unordered_mapmemo;//(board,hand)->minCount//求当board

shawn&lycheeo·2023-11-24 13:50

洛谷P3254：圆桌问题（二分图多重匹配，网络流最大流）

#includeusingnamespacestd;constintmaxn=1e3+10;constintmaxm=2e5+10;constintinf=0x3f3f3f3f;structss{in

ACM败犬·2023-11-23 15:59

Krustral算法求解最小生成树 C++实现

#include#includeusingnamespacestd;constintN=100010,M=200010,INF=0x3f3f3f3f;intn,m;intp[N];structEdge{

随风而散y·2023-11-22 22:26

最小生成树Prim算法详解(C++)

邻接表：#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;//定义

就叫你天选之人啦·2023-11-22 22:25

Prim算法求解最小生成树 c++代码实现

#include#includeusingnamespacestd;constintmaxn=100;constintinf=0x3f3f3f3f;intn,m,sum=0;intgraph[maxn]

cqggcqggcqggcqgg·2023-11-22 22:41

prim算法求解最小生成树 C++实现

#include#includeusingnamespacestd;constintN=510,INF=0x3f3f3f3f;intg[N][N];boolst[N];intdist[N];intn,m

随风而散y·2023-11-22 22:40

Day32力扣打卡

classSolution:defmaxProfit(self,k:int,prices:List[int])->int:n=len(prices)max=lambdax,y:xifx>yelseyf=[[-0x3f3f3f3f

Hongs_Cai·2023-11-21 09:41

Codeforces Round 871 (Div. 4) A ~ G

includeusingnamespacestd;#defineendl"\n"typedeflonglongll;typedefpairPII;typedefpairPIII;constintinf=0x3f3f3f3f

GHOSTANDBREAD·2023-11-20 06:11

hdu4738 Caocao's Bridges(Tarjan/双连通分量+桥+特判)

题目给一张n(n#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintmaxn=1e3+10;constintmaxm=maxn

Code92007·2023-11-19 01:02

AcWing 1068 环形石子合并题解（动态规划—DP—区间DP）

原题传送门#includeusingnamespacestd;constintN=410,INF=0x3f3f3f3f;intn,m;intw[N],s[N];intf[N][N],g[N][N];//

QingQingDE23·2023-11-14 11:17

Codeforces 242 E. XOR on Segment

include#include#defineintlonglongusingnamespacestd;constintN=100010;constintP=998244353;constintINF=0x3f3f3f3f

weixin_30342209·2023-11-14 07:47

acwing算法基础之搜索与图论--朴素版dijkstra算法

目录1基础知识2模板3工程化1基础知识朴素版dijkstra算法的关键步骤：初始化d[1]=0，d[2~n]=正无穷，例如0x3f3f3f3f。用集合S来表示当前已被确定最小距离的结点们。

YMWM_·2023-11-12 01:04

暑期留校——AcWing--kruskal算法模板

#include#include#include#includeusingnamespacestd;intn,m;intINF=0x3f3f3f3f;intp[10000010];structedge{

茜茜爱敲代码·2023-11-11 23:28

L2-036 网红点打卡攻略 (25 分)

){intn,m,a[210],book[210];cin>>n>>m;while(m--){intx,y,z;cin>>x>>y>>z;e[x][y]=z;e[y][x]=z;}intt,minn=0x3f3f3f3f

_Dawn__·2023-11-11 12:42

新年好 dfs+dijkstra

+10;inte[N],ne[N],h[N],w[N],idx;intn,m;intst[N];intdist[10][N];intst1[10];intp[10];intop[10];intres=0x3f3f3f3f

灬德布罗意的猫灬·2023-11-11 02:43

SCU 4527(dijkstra + 二分)

AC代码：#include#include#includeusingnamespacestd;constintmaxn=1e4+10;constintinf=0x3f3f3f3f;inthead[maxn

Error Man·2023-11-11 02:13

Codeforces Round #525 (Div. 2) A. Ehab and another construction problem

找到满足四个条件式的a和ba和b可以相等除了1都可以找到a=b=n这种情况满足条件AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2023-11-10 17:37

【123. 买卖股票的最佳时机 III】

目录一、题目描述二、算法原理三、代码实现一、题目描述二、算法原理三、代码实现classSolution{public:constintInit=-0x3f3f3f3f;intmaxProfit(vector

龙里出生的蛋·2023-11-10 08:09

The 2020 ICPC Asia Yinchuan Regional Programming Contest 银川 B. The Great Wall 题解

43210input2:512121output2:12210题意：有n个元素的数组，现要将数组分为k段（1usingnamespacestd;constintMAXN=1e4+10;constintinf=0x3f3f3f3f

sakura7776·2023-11-10 01:21

蓝桥云课--1024 第 2 场算法双周赛

defineIOSios::sync_with_stdio(false);cin.tie(0);cout.tie(0);usingnamespacestd;constintN=2e5+10;constintinf=0x3f3f3f3f

快乐的邮递员·2023-11-09 20:26

Prefix Equality（树状数组维护区间最值）

#includeusingnamespacestd;constintN=2e5+10,INF=0x3f3f3f3f;intn,m;//tr[i]维护a数组前i个数最大值在b数组中出现的最早位置//tr1

根本学不会的Kkkkk·2023-11-05 15:13

1 ~ n的k次方求和模板

*/#pragmaGCCoptimize(2)#pragmaGCCoptimize(3)#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f

_lifehappy_·2023-11-04 10:47

动态规划：线性DP

数字三角形：#includeusingnamespacestd;constintN=510,INF=0x3f3f3f3f;intf[N][N];//存路径长度inta[N][N];//存数字intmain

友纪YuKi·2023-11-01 14:43

uva 1078 - Steam Roller（最短路）

#include#include#include#include#includeusingnamespacestd;constintmaxn=105;constintinf=0x3f3f3f3f;constintUP

JeraKrs·2023-10-30 01:47

bellman_ford AcWing 853. 有边数限制的最短路

intdist[N];intbackup[N];intn,m,k;voidbellman_ford(){memset(dist,0x3f,sizeofdist);dist[1]=0;for(inti=0;i=0x3f3f3f3f

三冬四夏会不会有点漫长·2023-10-28 17:59

PTA A1030 Travel Plan (Dijkstra求单源最短路+边权花费+打印路径)

法1：Dijkstra+pre数组+c数组#include#include#includeusingnamespacestd;constintMAXV=510;constintINF=0x3f3f3f3f

-skyline-·2023-10-28 11:43

【计数DP】CF1794D

原因是组合数不知道怎么求首先需要注意到一些东西：1.底数一定是质数2.质数个数#defineintlonglongconstexprintN=1e6+10;constexprintmod=998244353;constexprintInf=0x3f3f3f3f

lamentropetion·2023-10-27 00:46

C. Raspberries-Codeforces Round 905 (Div. 3)

)>=1，答案可以ans=min((int)1,ans)#include#include#include#defineintlonglongusingnamespacestd;constintINF=0x3f3f3f3f

Lsxp1991·2023-10-24 09:20

POJ - 3470 Walls

（距离可能比0x3f3f3f3f大实现上，我是把鸟和墙的坐标放一起的，用下标来区别两者。/******************************************************

weixin_30493401·2023-10-24 02:06

leetcode665. 非递减数列

nums.length;intp=0,q=0;for(inti=0;inums[i+1]){p=i;q=i+1;break;}}if(q==0&&q==0)returntrue;intflag=0;intt=-0x3f3f3f3f

来旺·2023-10-22 23:54

【入门4】数组 (今天刷洛谷了嘛)

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

Joanh_Lan·2023-10-22 07:13

牛客练习赛59.E 石子搬运（数据结构优化dp）

LLcalc(intx,intn){if(xusingnamespacestd;//-----pre_def----constdoublePI=acos(-1.0);constintINF=0x3f3f3f3f

sancpp·2023-10-21 20:01

牛客练习赛86 C. 取钱(DP)

传送门分析见代码注释#includeusingnamespacestd;//-----pre_def----constdoublePI=acos(-1.0);constintINF=0x3f3f3f3f