0x3f3f3f3f 第21页

201809-3 元素选择器

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

cy41·2019-03-08 08:34

ccf 小明放学 201812-2

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

cy41·2019-03-06 19:54

最大权闭合子图

一、模板题：P4174[NOI2006]最大获利1#include2usingnamespacestd;3constintMAX=4e5,INF=0x3f3f3f3f,MAXN=4e5;4structppp

Member·2019-02-24 16:00

和至少为 K 的最短子数组(双端队列实现单调栈)leetcode862

k]-s[i]>=K→s[k]-s[j]>=k,因此此时的s[i]可以被丢弃b.有贪心思想可知这个序列不可能以负数或0开头或者结尾所以如果存在s[k]&A,intk){dequedeq;intans=0x3f3f3f3f

卯足劲过样例·2019-02-17 16:10

畅通工程续 -- HDU 1874 floyd

AC代码：#include#include#includeusingnamespacestd;constintMX=1000+10;constintINF=0x3f3f3f3f;intn,m;intmp

mpeter·2019-02-15 23:00

Wormholes 虫洞 HYSBZ - 1715 【SPFA算法】

其中1#include#include#include#includeusingnamespacestd;constintMAXN=1010;constintINF=0x3f3f3f3f

han_hhh·2019-02-10 21:04

牛客寒假算法基础集训营6 C 项链贪心

i])每次用涂色数量*喜欢程度求和就是答案注意开longlongAC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-02-02 18:00

Gym - 101502I- Move Between Numbers (最短路)

/*建立无权图:两数间可达就连一条边；最后求最短路即可*/#includeusingnamespacestd;constintmaxn=250+10;constintinf=0x3f3f3f3f;intt

婷霸·2019-01-29 20:34

CCPC-Wannafly Winter Camp Day5 (Div2, onsite) H Nested Tree 树形dp

题解按照题意将m课树合并为一颗树题目保证合并后必定为一棵树且端点数量不超过n*m#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-24 19:28

CCPC-Wannafly Winter Camp Day5 (Div2, onsite) F Kropki 状压dp

的情况下方案数量从前向后推枚举每个位置枚举当前位置使用的数字枚举下个位置使用的数字枚举所有状态进行转移如果满足条件则直接加上当前数量注意2倍关系是双向的AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-24 19:42

CCPC-Wannafly Winter Camp Day5 (Div2, onsite) C Division 贪心

1e9所以最多进行nlogv次就能将数值全变为0当队首为0时推出循环AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-24 19:20

CCPC-Wannafly Winter Camp Day5 (Div2, onsite) A Cactus Draw

范围内即使是一条链也可以满足兄弟节点在同一行的坐标并依次往后排列最后按照节点序号输出答案AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-24 19:49

CCPC-Wannafly Winter Camp Day4 (Div2, onsite) I 咆咆咆哮贪心暴力

计算每个数值选择a比选择b高出的收益然后降序排序并选择前i个答案取max即可AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-23 20:38

Codeforces Round #533 (Div. 2)A. Salem and Sticks

10001<=n<=10001#defineendl'\n'usingnamespacestd;typedeflonglongll;constintinf=1100;constintINF=0x3f3f3f3f

i-Curve·2019-01-21 19:34

comet OJ 热身赛 K. principal 括号匹配

检测b数组b[r]==b[l-1]如果相等则表示范围内括号被匹配掉AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-19 15:11

comet OJ 热身赛 H. checkin

AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;intmain(){#ifdefLOCAL/

CaprYang·2019-01-19 15:28

comet OJ 热身赛 E. dijkstra dijkstra

线与圆利用点到直线距离-圆半径与0取max圆到圆直接点距离公式-半径与0取maxAC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-19 15:33

comet OJ 热身赛 C. eustia 贪心

题解贪心合并合并策略每次尽量合并为较大的继续合并先从小到大排序从第二个开始如果和上一个相比大于m则ans++AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-19 15:49

Educational Codeforces Round 58 (Rated for Div. 2) A. Minimum Integer

的情况最小为d大于r的情况(r/d+1)*d第一个大于r的d的倍数AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2019-01-13 14:11

C++ priority_queue用法

升序、重载#include#include#include#include#include#includeusingnamespacestd;usingLL=longlong;constintinf=0x3f3f3f3f

kwansy·2018-12-27 20:10

链式前向星模板建图+dfs+bfs+dijkstra

节点和边的计数起点如果不符合习惯可以稍作修改建图+DFS+BFS#include#include#includeusingnamespacestd;typedeflonglongLL;constintinf=0x3f3f3f3f

kwansy·2018-12-26 00:38

楼上说的对 ZZULIOJ - 2462 二进制

倍出现过的二次幂的和即为答案二次幂的和等于n范围内最大二进制*2-1不断除以2求出最大二进制为2的几次方AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2018-12-17 22:46

欧拉函数的求法

longlongans=n;for(inti=2;i*i1)ans-=ans/n;returnans;}筛法求欧拉函数constintmaxn=1e5;constintbranch=26;constintinf=0x3f3f3f3f

KetchupZ·2018-12-12 19:20

HDU1003

*/publicclassMain{privatestaticfinalintM=-0x3f3f3f3f;publicstaticvoidmain(String[]args){//System.out.println

眼镜猫头鹰·2018-12-05 09:59

蓝桥杯校内选拔热身赛部分题解

标程#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;intmain(){#ifdefLOCALfreopen

CaprYang·2018-11-13 17:12

循环队列打印杨辉三角

include#include#include#include#include#include#include#include#includetypedeflonglongll;constintinf=0x3f3f3f3f

KobeSacre·2018-11-10 17:15

最短路也疯狂

Ford(O(|V|*|E|))(可以判断是否有负环)基本写法对了，安利一道要用Ford的题这是我过了的代码题目是POJ-3259#include#include#includeconstintINF=0x3f3f3f3f

Autumn_ghost·2018-10-28 18:13

poj1695 dp思维不错

#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;intdp[31]

__meteor·2018-10-26 15:30

有意思的签到题集合~~

代码#include#include#include#includeusingnamespacestd;constintmaxn=1e6+7;constintINF=0x3f3f3f3f;typedeflonglongll

1900_·2018-10-24 22:34

HDU 1874 畅通工程续最短路径

：根据给出的路径，找出从起点s到终点e的最短路径输出即可Dijkstra算法#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f

LMengi000·2018-10-20 11:35

美好的邂逅(floyd)

美好的邂逅#includeusingnamespacestd;constintMAXN=305;constintINF=0x3f3f3f3f;intgroup1[MAXN];intgroup2[MAXN

ccshijtgc·2018-10-19 09:51

蒜头君的训练室（floyd)

蒜头君的训练室#includeusingnamespacestd;constintMAXN=305;constintINF=0x3f3f3f3f;intgroup1[MAXN];intgroup2[MAXN

ccshijtgc·2018-10-19 09:02

Kth number HDU - 2665 可持久化线段树主席树

题解求区间第K大主席树模版AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;constintMAXN

CaprYang·2018-10-17 22:44

【洛谷 P3381】最小费用最大流（SPFA+EK）

#includeusingnamespacestd;constintmaxn=100050;constintINF=0x3f3f3f3f;inthead[maxn];boolvis[maxn];intdis

codancer·2018-10-10 09:32

HDU - 2612 bfs加打表

的话会超时;#include#include#include#include#include#includeusingnamespacestd;typedeflonglongll;constintinf=0x3f3f3f3f

cy41·2018-10-09 18:57

宝藏

代码#include#includeconstintinf=0x3f3f3f3f;i

CE自动机·2018-10-02 11:24

ACM/ICPC 2018亚洲区预选赛北京赛站网络赛 B. Tomb Raider

暴力尝试答案是否正确最后找字典序最小注意只有一个串的时候也需要找字典序最小AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2018-09-22 17:29

Codeforces Round #511 (Div. 2) C. Enlarge GCD

"素数"处理过的位置标记不在处理过程中计算有多少个数字能被i整除AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2018-09-22 02:34

Codeforces Round #511 (Div. 2) B. Cover Points

轴上画一个等腰三角形把所有点包含在内问满足条件的最小等腰三角形的直角边长AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2018-09-22 01:35

Codeforces Round #511 (Div. 2) A. Little C Loves 3 I

题解题目大意给一个数字n让你分解为三个数字abcabc都不能被三整除AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2018-09-22 01:48

UVALive ~ 3231 ~ Fair Share （公平分配问题）

#includeusingnamespacestd;constintMAXN=1e5+5;constintINF=0x3f3f3f3f;structEdge{intfrom,to,cap,flow;//

张松超·2018-09-19 17:05

求大数的n次方对m取模（欧拉降幂）

博主链接#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;constintMAXN=1e5+10;constintMOD

Anoyer·2018-09-15 21:03

ACM-ICPC 2018 焦作赛区网络预赛 L. Poor God Water

(n-2)+3f(n-3)+2*f(n-4)使用矩阵快速幂求解#AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2018-09-15 17:21

Made In Heaven

//该题与poj2449基本相同#include#include#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f

KLFTESPACE·2018-09-13 21:59

2018年清华软院保研夏令营第3题：质因子（单调队列）

题目给定N个质数，构成集合S，设集合T为由质因子全部在S中的整数构成的集合，求T中第k小的数，其中1#includeconstintKMAX=1e5+5,INF=0x3f3f3f3f;intn;intpr

da_kao_la·2018-09-06 17:25

2015年清华软院保研机试第2题：找到算式 (dfs)

因为如果能够得到目标数字要输出算式，所以dfs函数的输出（记作ret）就是一个表示运算符的数，该数的每一个二进制位对应一个运算符，具体来说：if(ret&(1constintINF=0x3f3f3f3f

da_kao_la·2018-09-05 20:19

【HDU】2255奔小康赚大钱二分图最大权匹配&KM算法

算法详解+模板-Chierush(理论讲解清晰,附带模板)km算法入门-logosG(有算法的模拟和详细图解)代码#includeusingnamespacestd;constintN=330,inf=0x3f3f3f3f

ccosi·2018-09-04 22:58

kuangbin专题一 catch the cow (BFS)

include#include#include#includeusingnamespacestd;typedeflonglongll;constintmaxn=100000+7;constintinf=0x3f3f3f3f

Calculus_a·2018-09-03 21:57

Wannafly挑战赛23 A-字符串(暴力)

以每个字母为子串的开头对整个字符串扫一遍...AC代码：#includeusingnamespacestd;stringstr;mapma;intmain(){cin>>str;intlen=str.length();intans=0x3f3f3f3f

Charlesssf·2018-08-31 23:16

关于km算法(最佳匹配)的个人总结——模板

：https://blog.csdn.net/u014097230/article/details/51554905本文只是模板#include#include#includeconstintINF=0x3f3f3f3f

Com_ice·2018-08-30 21:04

推荐频道

0x3f3f3f3f