0x3f3f3f3f 第17页

HDU 3233 Download Manager

A,B)memcpy(A,B,sizeof(A))typedeflonglongLL;typedefunsignedlonglonguLL;constintMOD=1e9+7;constintINF=0x3f3f3f3f

Kim0403·2020-07-06 22:34

输出图中所有负环上的点

#include#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintMAX_V=100+1;intV,m;typedefpairP

Dwenking·2020-07-06 21:20

AtCoder Beginner Contest 042题解(ABCD)

#includeusingnamespacestd;typedeflonglongll;constintN=1e5+5,M=1e6+5,inf=0x3f3f3f3f,mod=1e9+7;#definemst

Harris-H·2020-07-06 19:55

洛谷P1433 吃奶酪

输入输出格式输入格式：第一行一个数n(nusingnamespacestd;structnode{doublex,y;}a[16];boolvis[16];intn;doubleans=(double)0x3f3f3f3f

baby的我·2020-07-06 17:53

poj 3164 通信网络最小树状图

#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;constintmaxn=1005;structpoint

PK__PK·2020-07-06 15:33

UVA - 1328 Period KMP算法

数组存的是前一个循环节的位置，只要判断前一个是不是一个循环节就好了#include#include#include#includeusingnamespacestd;constintmaxn=1000000+7,INF=0x3f3f3f3f

冰冰的小宝贝·2020-07-06 08:15

cdq解决LIS问题

#includeusingnamespacestd;#defineLLlonglongconstintinf=0x3f3f3f3f;constintN=100005;intdp[N],a[N],b[N]

_leon1999·2020-07-06 02:14

Slim Span UVA - 1395 （并查集）

AC代码：#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;structEdge{intu,v,w;E

weixin_33759269·2020-07-05 22:33

图论/暴力 Codeforces Beta Round #94 (Div. 2 Only) B. Students and Shoelaces

，不懂:)3*/4#include5#include6#include7#include8usingnamespacestd;910constintMAXN=1e2+10;11constintINF=0x3f3f3f3f

weixin_33674976·2020-07-05 22:53

noip 2014 子矩阵

1#include2#include3#include4#include5#include6#include7usingnamespacestd;8constintN=20;9constintinf=0x3f3f3f3f

weixin_30627381·2020-07-05 21:41

HDU 2255 奔小康赚大钱（KM算法）

pid=2255【题目大意】求最大匹配【题解】KM模板【代码】#include#include#includeusingnamespacestd;constintN=310,INF=0x3f3f3f3f

weixin_30389003·2020-07-05 20:55

uvalive4731

代码：#includeusingnamespacestd;#include#include#includeconstintINF=0x3f3f3f3f;constint

big up·2020-07-05 19:57

RQNOJ Mato完整版学体育

题目链接由于这题的最后一组数据有问题，所以就只好cheat了#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f

傻笨·2020-07-05 15:34

Til the Cows Come Home-Poj2387（最短路）

ac代码（bellman-ford)://#include#include#includeusingnamespacestd;constintINF=0x3f3f3f3f;constintMAXN=1e5

sakuryu·2020-07-05 11:14

HDU 1276 士兵队列训练问题（队列、模拟）

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

WA-Accepted·2020-07-05 09:05

Codeforces Round #552 (Div. 3) ABCDE题解

1154A.RestoringThreeNumbers注意看清题意，是a+b不是-a+b；代码如下：#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

这样啊我也喜欢·2020-07-05 08:15

Educational Codeforces Round 50: B Diagonal Walking v.2

，就可以发现规律，分一下奇偶即可#include#include#include#include#include#include#include#include#includeconstintinf=0x3f3f3f3f

Ostrichcrab·2020-07-05 08:57

codeforces简单思维题合集

includeusingnamespacestd;#defineLLlonglong#definedbdoubleconstintMAXN=200;constintLIM=101;constintINF=0x3f3f3f3f

Karshilov·2020-07-05 06:59

Plug for UNIX UVA - 753

include#includeusingnamespacestd;typedeflonglongll;mapid;intst,ed;intcnt;constintmaxn=410;constintinf=0x3f3f3f3f

qq_36424540·2020-07-05 06:21

Codeforces Round #640 (Div. 4) C. K-th Not Divisible by n (数论，思维)

defineNewNode(ListNode*)malloc(sizeof(ListNode))#defineMem(a,b)memset(a,b,sizeof(a))constintN=1e5+5;constintINF=0x3f3f3f3f

要无愧于人·2020-07-05 00:23

102263 - ArabellaCPC 2019（部分）解题报告

easy#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;constintN=1e5+5;lln,k;intmain(

CoordinateKND·2020-07-04 20:27

01背包练习

include#include#include#include#includeusingnamespacestd;#defineDEBUGconstintmaxn=100+5,maxv=26,INF=0x3f3f3f3f

j_d_m_y·2020-07-04 19:19

板子

目录矩阵快速幂最短路最大流/最小割二分图最大独立集强连通分量矩阵快速幂#include#definelllonglongusingnamespacestd;constintmaxn=1e6+5;constintINF=0x3f3f3f3f

只有魔法才能对抗魔法·2020-07-04 16:27

2017 ACM-ICPC 亚洲区（乌鲁木齐赛区）网络赛 [计蒜客] Our Journey of Dalian Ends

代码#includeusingnamespacestd;constintMAXN=1e5+5,INF=0x3f3f3f3f;structEdge{intv,w,f,nxt;}e[MAXNmp;boolSPFA

geng4512·2020-07-04 16:55

poj-2676sudoku

#include#include#include#includeusingnamespacestd;constintmaxn=10;constintINF=0x3f3f3f3f;intT,cnt;intmp

__meteor·2020-07-04 15:40

Educational Codeforces Round 79 (Rated for Div. 2) A-D

#includeusingnamespacestd;constintinf=0x3f3f3f3f;intmain(){ios::sync_with_stdio(0);cin.tie(0);cout.tie

hehedad·2020-07-04 13:31

Island Transport HDU - 4280（ISAP模板）

链接#include#definelllonglongusingnamespacestd;constintmaxn=1e5+5;constintmaxm=1e5+5;constintinf=0x3f3f3f3f

cheng__yu_·2020-07-04 13:35

[枚举最小瓶颈生成树]UVa-1395 - Slim Span(kruskal)

就是紫书的思路，像暴力#includeusingnamespacestd;constintMAXN=105;constintINF=0x3f3f3f3f;structEdge{intu,v,cost;booloperatora.cost

BEconfidence·2020-07-04 10:09

RMQ with Shifts(线段树）

之后回顾的时候再写思路#include#include#includeconstintinf=0x3f3f3f3f;usingnamespacestd;intmine[1000005];intn,q;charss

Virtualllll·2020-07-04 09:30

Codeforces Round #587 (Div. 3)

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

月本_诚·2020-07-04 08:05

用 0x3f3f3f3f 设定最大int值的优点

在许多算法中都要用到一个常量来表示最大值，例如：寻找一个最小数，就要先设定一个值a，如果比a小，a就等于这个数；再如，最短路径中基本的松弛操作：1if(d[u]+w[u][v]

子言慕雨·2020-07-04 08:04

Educational Codeforces Round 82 (Rated for Div. 2)ABC

直接暴力找两个一之间的间距#includeusingnamespacestd;typedeflonglongll;constintN=1e5+100;constintM=4e5+100;constintINF=0x3f3f3f3f

yyyan_·2020-07-04 08:16

7-35 城市间紧急救援 (25 分)

#include#include#include#include#include#includeusingnamespacestd;constintN=505;constintINF=0x3f3f3f3f

姚军博客·2020-07-04 08:14

7-36 社交网络图中结点的“重要性”计算 (30 分)

BFS并查集判断#include#include#include#include#include#includeusingnamespacestd;constintN=1e4+5;constintINF=0x3f3f3f3f

姚军博客·2020-07-04 08:14

NOIP2017宝藏

#include#include#include#include#includeusingnamespacestd;constintinf=0x3f3f3f3f;constintmaxn=1x)&&pic

Milking_you·2020-07-04 07:49

Codeforces Round #623 (Div. 2, based on VK Cup 2019-2020 - Elimination Round, Engine)

//二分答案：#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f;constl

陆小萌·2020-07-04 07:41

SDUT_2015寒假集训_最短路_A-最短路（Floyd）

每组数据第一行是两个整数N、M（Nusingnamespacestd;constintINF=0x3f3f3f3f;intmain(){ios

highmath·2020-07-04 07:06

nyoj--38（布线问题）

还有在对邻接矩阵赋初值时，可以巧用0x3f3f3f3f,即memset(mark,0x3f,sizeof(mark));布线问题时间限制：1000ms|内存限制：65535K

阿阿阿黄·2020-07-04 06:38

C语言编程练习题之括号匹配

#include#include#include#include#include#include#include#include#include#include#includeconstintINF=0x3f3f3f3f

♛Tony〒G〒Han♛·2020-07-04 05:12

Codeforces Round #521 (Div. 3) C. Good Array 思维

数字的序列从序列中删除某些元素让剩下的序列当中有一个数等于其它数字之和记录每个数字出现的次数枚举每一个数字尝试减去如果原数列出现过减去之后和的一半则满足条件(需要排除自身a[i]==s2/2)AC代码#include#includeusingnamespacestd;typedeflonglongll;constintINF=0x3f3f3f3f

CaprYang·2020-07-04 04:16

Codeforces Round #651 (Div. 2) 部分题解

KeepongoingNevergiveup*/#pragmaGCCoptimize(3,"Ofast","inline")#includeconstintmaxn=1e6+10;constintMaxN=0x3f3f3f3f

昵称很长很长真是太好了·2020-07-04 03:40

【CQOI2017】bzoj4823 老C的方块

#include#include#includeusingnamespacestd;constintmaxn=100010,s=100005,t=100006,oo=0x3f3f3f3f;intrd()

sdfzyhx·2020-07-04 01:04

edu90 - D. Maximum Sum on Even Positions （策略 : 子数组的反转）

defineLLlonglong#definepiipair#definemem(a,b)memset(a,b,sizeof(a))usingnamespacestd;constintmaxn=1e6+5;constintinf=0x3f3f3f3f

Bug原产地·2020-07-02 15:22

简单瞎搞题（ STL——bitset ）

defineLLlonglong#definepiipair#definemem(a,b)memset(a,b,sizeof(a))usingnamespacestd;constintmaxn=1e6+5;constintinf=0x3f3f3f3f

Bug原产地·2020-07-02 15:22

操作数（数论：前n项的前n项和）

defineLLlonglong#definepiipair#definemem(a,b)memset(a,b,sizeof(a))usingnamespacestd;constintmaxn=1e5+5;constintinf=0x3f3f3f3f

Bug原产地·2020-07-02 15:50

Atcoder 500 Grid Component 构造

题意:给出a,ba,busingnamespacestd;typedeflonglongll;constintN=2e3+5,inf=0x3f3f3f3f;chars[N][N];inta,b,n=100

orz11111111·2020-07-02 13:33

NOI 7624 山区建小学（动态规划）

已知任意两个相邻的村庄之间的距离为di（为正整数），其中，0usingnamespacestd;constintinf=0x3f3f3f3f;intdp[505][505],dis[505][505],

henu_jizhideqingwa·2020-07-02 02:09

NOI题库7624 山区建小学（162:Post Office / IOI2000 POST OFFICE [input] ）

已知任意两个相邻的村庄之间的距离为di（为正整数），其中，02#include3#include4usingnamespacestd;56constintmaxn=500+10;7constintINF=0x3f3f3f3f

hahalidaxin·2020-07-02 01:24

省选专练【网络流24题】最小路径覆盖问题

但是还是学习了一下怎么记录路径由于流量为1所以直接把1的流量用掉的时候路径必然是这一条然后处理一个next数组递归打印#includeusingnamespacestd;constintINF=0x3f3f3f3f

Leo_JAM·2020-07-01 23:36

牛客北京信息科技大学第十一届程序设计竞赛 E kotori和素因子(dfs)

#include#definelllonglongusingnamespacestd;constintN=1e3+10;constintinf=0x3f3f3f3f;//vectorpd[20];intpr

Qingo呀·2020-07-01 18:19

推荐频道

0x3f3f3f3f