0x3f3f3f3f 第15页

地铁环线（前缀和）

include#include#include#includeusingnamespacestd;typedeflonglongll;constintMOD=10000007;constintINF=0x3f3f3f3f

WA-Accepted·2020-08-02 13:21

TOJ 3651 拓扑排序模板题

QQ空间时间限制(普通/Java):1000MS/3000MS内存限制:65536KByte总提交:248测试通过:148描述有N个比赛队（1usingnamespacestd;constintinf=0x3f3f3f3f

Wu_yux·2020-08-01 11:38

自然数k次幂的和 CF622 F .The Sum of the k-th Powers（拉格朗日插值）

好多拉格朗日插值的题，最后化简之后的式子都用到了这个模板代码：//i的k次幂之和typedeflonglongll;usingnamespacestd;constintMAXN=1e6+500;constintinf=0x3f3f3f3f

_Alexander·2020-08-01 06:08

牛客小白月赛23 G树上求和 (dfs)

一遍求出每个子树的大小统计一下每条边经过的次数，排序赋值即可代码：typedeflonglongll;usingnamespacestd;constintMAXN=1e5+50;constintinf=0x3f3f3f3f

_Alexander·2020-08-01 06:08

Codeforces Round #553 (Div. 2) D

题解：就是从小到大对（ai-bi）进行排序#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;constintmod=1e9

THE END GAME·2020-08-01 06:05

Codeforces Round #627 (Div. 3) E&F

#includeusingnamespacestd;intdp[2005][2005],a[2005];intmain(){intn,h,l,r;cin>>n>>h>>l>>r;memset(dp,-0x3f3f3f3f

行走天涯的豆沙包·2020-08-01 05:59

Codeforces Round #239 (Div. 2)

1#include2#include3#include4usingnamespacestd;5constintMAX=100+10;6constintinf=0x3f3f3f3f;7intk[MAX];

weixin_30491641·2020-08-01 03:51

【2016杭电女生赛1001】【C语言签到题】Solving Order

#include#include#include#includeusingnamespacestd;constintN=12,M=0,Z=1e9+7,ms63=0x3f3f3f3f;intcasenum

snowy_smile·2020-08-01 00:10

洛谷P2754 [CTSC1999]家园 / 星际转移问题【网络流/按时间拆点/前后】

definepbpush_backusingnamespacestd;typedeflonglongll;constintmaxn=1e5+7;constintmod=1e9+7;constintinf=0x3f3f3f3f

MaJorieL·2020-07-31 23:49

洛谷P1402 酒店之王【网络流/点的限制/拆点】

definepbpush_backusingnamespacestd;typedeflonglongll;constintmaxn=1200;constintmod=1e9+7;constintinf=0x3f3f3f3f

MaJorieL·2020-07-31 23:49

HDU 2019 数列有序!（水题）

include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintmaxn=110;constintINF=0x3f3f3f3f

WA-Accepted·2020-07-31 23:23

lda c++代码

#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;constintMAX_M=1e4+5;constintMAX_K=

Augetylrr·2020-07-31 23:44

hdu1054

definepiacos(-1)#definelllonglong#definemod1000000007usingnamespacestd;constintN=1500+5,maxn=100+5,inf=0x3f3f3f3f

jellyfish_w·2020-07-31 22:58

poj1062

则在某个点作为贸易终点娶得美人归的花费就是它的价值加上酋长到该点的最小花费#include#include#includeusingnamespacestd;constintN=110;constintinf=0x3f3f3f3f

jellyfish_w·2020-07-31 22:57

例题11-11 赛车比赛单源最短路 spfa

#include#include#include#include#include#include#includeconstintmaxn=100005;constintINF=0x3f3f3f3f;typedeflonglongLL

小萨摩·2020-07-31 22:26

Educational Codeforces Round 45

ACommentaryBoxes算一下两个数，取最小的#includeusingnamespacestd;constintnmax=1e6;constintINF=0x3f3f3f3f;typedeflonglongll

pengwill97·2020-07-31 20:27

hdu多校第三场

definesesecond#definemkmake_pair#definepiipairusingnamespacestd;constintN=1e5+7;constintM=1e4+7;constintinf=0x3f3f3f3f

afd5154·2020-07-31 15:59

HDU 1003 Max Sum（Java）

*;publicclassMain{privatestaticfinalintM=-0x3f3f3f3f;privatestaticScannerin;publicstaticvoidmain(String

这条街上最靓的妞儿·2020-07-31 15:34

Educational Codeforces Round 55 (Rated for Div. 2)

/codeforces.com/contest/1082A题#includeusingnamespacestd;typedeflonglongll;constintN=105;constintINF=0x3f3f3f3f

yyyan_·2020-07-31 14:42

洛谷 P3369 【模板】普通平衡树 (Treap)

代码#includeusingnamespacestd;constintmaxn=1e5+10;constintinf=0x3f3f3f3f;structTreap{intl,r;intval,dat;

G19850917·2020-07-31 13:24

SWUST OJ 1027.舞伴问题

实现出队跳舞和跳完舞归队两个过程循环即可附上代码#include#defineintlonglong#definelowbit(x)(x&(-x))usingnamespacestd;constintINF=0x3f3f3f3f

Fiveneves·2020-07-31 13:45

Codeforces Round #553 (Div2)

CodeforcesRound#553(Div.2)ABCD题解A.MaximandBiology思路：暴力即可#includeusingnamespacestd;constintinf=0x3f3f3f3f

KetchupZ·2020-07-31 13:04

Codeforces 1354 B. Ternary String（尺取）

题意：找最短的子串包含1，2，33个字符，尺取模板题代码：typedeflonglongll;usingnamespacestd;constintMAXN=1e5+50;constintinf=0x3f3f3f3f

_Alexander·2020-07-31 13:13

HDU 6333 Problem B. Harvest of Apples(莫队算法)

returnF[n]*1ll*Finv[n-m]%mod*Finv[m]%mod;}AC代码：#include#definelllonglongusingnamespacestd;constintINF=0x3f3f3f3f

心照不必宣·2020-07-31 12:31

搜索金币阵列问题

金币阵列问题问题描述：有mxn(m#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;typedeflonglongLL;constintmaxn

Motongxue·2020-07-30 23:35

Prim算法求最小生成树（模板题）

表示点数intg[N][N];//邻接矩阵，存储所有边intdist[N];//存储其他点到当前最小生成树的距离boolst[N];//存储每个点是否已经在生成树中//如果图不连通，则返回INF(值是0x3f3f3f3f

moyangxian·2020-07-30 18:29

洛谷 P1005 矩阵取数游戏

->big#include#include#include#include#include#include#definelllonglongusingnamespacestd;constintINF=0x3f3f3f3f

做回甲乙丙丁·2020-07-30 16:41

2020牛客多校训练 G-Grid Coloring

我怀疑我偷渡成功#include#include#include#include#include#include#definelllonglongusingnamespacestd;constintINF=0x3f3f3f3f

做回甲乙丙丁·2020-07-30 16:41

CCF201812-5 管道清洁题解(最小费可行流)

AC代码：#include#include#includeusingnamespacestd;constintmaxn=233;constintinf=0x3f3f3f3f;structnode{intu

_ 泛白·2020-07-30 16:35

BSGS简叙

#includeusingnamespacestd;#definelllonglongconstintmaxn=1e6+7;constintmod=998244353;constintINF=0x3f3f3f3f

齐芒·2020-07-30 13:00

第十五届浙江大学宁波理工学院程序设计大赛（同步赛）补题

acm/contest/303#questionA签到了#includeusingnamespacestd;typedeflonglongll;constintN=1e6+100;constintINF=0x3f3f3f3f

yyyan_·2020-07-30 11:32

Olya and Energy Drinks CodeForces - 877D（BFS+剪枝）

剪枝1：扩展时就判断是否到达终点936ms/2000ms物美价廉的剪枝#includeusingnamespacestd;constintN=1005,INF=0x3f3f3f3f;chars[N][N

weixin_42104573·2020-07-30 10:03

PTA B1025 反转链表 (25 分)（静态链表）

include#include#include#includeusingnamespacestd;typedeflonglongll;constintMOD=10000007;constintINF=0x3f3f3f3f

WA-Accepted·2020-07-30 09:19

Investigating Legions(乱搞)

#includeusingnamespacestd;typedeflonglongll;constintN=305,M=2e4+5,inf=0x3f3f3f3f,mod=1e9+7;#de

Harris-H·2020-07-30 05:35

HDU 1242 Rescue（优先队列+广度优先搜索）

HewasputinprisonbyMoligpy.TheprisonisdescribedasaN*M(N,M#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f

拂袖秋波·2020-07-29 23:10

bfs之迷宫最短路径

（本题假定迷宫是有解的）(N,M#includeusingnamespacestd;constintMAX_N=100;constintMAX_M=100;constintINF=0x3f3f3f3f;

少年织梦·2020-07-29 22:33

邮票问题-动态规划

N#include#includeusingnamespacestd;intw[110];//每个邮票的面值intf[110];intmax;//枚举最大面值intn,m,t;constintinf=0x3f3f3f3f

lyyy.·2020-07-29 20:17

（01背包）洛谷P1060开心的金明

代码：#includeconstintN=1e5+10;constintmod=1e7+9;constintmaxn=0x3f3f3f3f;constintminn=0xc0c0c0c0;constintinf

会飞的小蛇·2020-07-29 16:05

Little M s attack plan The Preliminary Contest for ICPC Asia Xuzhou 2019

x))#defineREP(i,a,n)for(inti=a;iP;constintmaxn=1e5+10;constintN=1e6+10;constintM=2e6+10;constintinf=0x3f3f3f3f

M_theory004·2020-07-29 11:20

贪心暴力思维题（持续更新Ing）

所以分享一波首先对所有的牛排序一波然后枚举分界点分界点左边向右移分界点右边向左移然后排序更新其中的最小值#includeusingnamespacestd;constintmaxn=55;inta[maxn],b[maxn],minn=0x3f3f3f3f

Pluto_cc·2020-07-29 06:04

Codeforces Round #642 (Div. 3) 题解

A.MostUnstableArray代码：#include#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f

forOnward·2020-07-28 21:56

prim 求最小生成树（邻接矩阵）

#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;//无穷数constintmaxn=100;//最大城市数；intguide

henuzsh·2020-07-28 12:45

hdu2152（母函数入门）

("out.txt","w",stdout);#definelsonl,m,rpii;typedefpairpll;typedefpairpdd;typedefpairpdi;constintINF=0x3f3f3f3f

reallsp·2020-07-28 10:08

背包问题模板

）混合背包二维费用分组背包01背包(不需要装满)importjava.util.Scanner;publicclassZeroOnePack{staticintN=1010;staticintINF=0x3f3f3f3f

miku的肯定·2020-07-28 09:21

洛谷P4124 [CQOI2016] 手机号码数位dp

#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f;constllINF=LONG_LONG_

SigmaQuadrant·2020-07-28 08:29

2020hdu多校 1004Distinct Sub-palindromes

要打破这种局面就只有abcabcabc所以分类讨论即可代码#include#definelllonglong#defineintlonglongusingnamespacestd;constintINF=0x3f3f3f3f

kosf_·2020-07-28 01:27

HDU 1171 Big Event in HDU——多重背包+二进制优化

#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;intn,val[100],cnt[100],a[500

hao_zong_yin·2020-07-27 23:38

HDU 1171 Big Event in HDU——二进制优化多重背包

数组里找价值的最小值即可这里偷懒只用了二进制优化，跑得挺慢#include#include#include#includeusingnamespacestd;constintmaxn=5e4+10;constintINF=0x3f3f3f3f