E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
TON
Moving On（floyd）
题目描述FirdawsandFatinaharelivinginacountrywithncities,numberedfrom1
ton
.Eachcityhasariskofkidnappingorrobbery.Firdaws
eazo
·
2020-08-21 06:26
图论
2018 宁夏邀请赛 Moving On Gym - 102222F（深入理解三维floyd）
FirdawsandFatinaharelivinginacountrywithncities,numberedfrom1
ton
.Eachcityhasariskofkidnappingorrobbery.Firdaws
qdu_ellery
·
2020-08-21 06:52
dp
图
F - Moving On
DescriptionFirdawsandFatinaharelivinginacountrywithncities,numberedfrom1
ton
.Eachcityhasariskofkidnappingorrobbery.Firdaws'shomelocatesinthecityu
天涯-沧海
·
2020-08-21 05:46
1000篇
产生随机数组的方法（后续更新）
我想介绍看到的两种产生随机数组的方法，伪代码如下：第一种：优先级排序法：PERMUTE-BY-SORTING(A)1n=length[A];2fori=1
ton
3doP[i]=RANDOM(1,n*n*
azft68818
·
2020-08-21 03:49
New Year Book Reading
sourceDescriptionNewYeariscoming,andJaehyundecidedtoreadmanybooksduring2015,unlikethisyear.Hehasnbooksnumberedbyintegersfrom1
ton
.Theweightofthei-th
Gitfan
·
2020-08-20 20:59
【OpenStack】【Rocky】安装Rocky之前的先决条件包
openstack-selinux包系统参考信息[tony@tony-controller~]$cat/etc/redhat-releaseCentOSLinuxrelease7.6.1810(Core)[tony@
ton
一凡stkeke
·
2020-08-20 18:19
Openstack
F - Game HDU - 3389
BobandAliceareplayinganewgame.Therearenboxeswhichhavebeennumberedfrom1
ton
.Eachboxiseitheremptyorcontainsseveralcards.BobandAlicemovethecardsinturn.Ineachturnthecorrespondingplayershouldchooseanon-empt
starlet_kiss
·
2020-08-20 11:01
HDU3389 Game
ProblemDescriptionBobandAliceareplayinganewgame.Therearenboxeswhichhavebeennumberedfrom1
ton
.Eachboxiseitheremptyorcontainsseveralcards.BobandAlicemovethecardsinturn.Ineachturnthecorrespondingplayersho
aoanping0730
·
2020-08-20 09:01
HDU - 3389(40/600)
BobandAliceareplayinganewgame.Therearenboxeswhichhavebeennumberedfrom1
ton
.Eachboxiseitheremptyorcontainsseveralcards.BobandAlicemovethecardsinturn.Ineachturnthecorrespondingplayershouldchooseanon-empt
NineFailure
·
2020-08-20 09:15
ACM练习
博弈
SWUSTOJ #480 Locker doors
SWUSTOJ#480Lockerdoors题目输入输出样例输入样例输出源代码题目Therearenlockersinahallwaynumberedsequentiallyfrom1
ton
.Initially
im_IC
·
2020-08-20 03:19
SWUST
OJ
题解系列
SWUST
SWUSTOJ
OJ
C++
题解
AIZU 2170 Marked Ancestor
ProblemF:YouaregivenatreeTthatconsistsofNnodes.Eachnodeisnumberedfrom1
toN
,andnode1isalwaystherootnodeofT.ConsiderthefollowingtwooperationsonT
Novel_Youn_Dong
·
2020-08-20 03:01
OJ
【CodeForces 1260E --- Tournament】
wherenboxerswillparticipate(nisapowerof2),andyourfriendisoneofthem.Allboxershavedifferentstrengthfrom1
ton
私忆一秒钟
·
2020-08-20 02:15
ACM
从一维到二维:最大子段和和最大子矩阵和
首先我们看这道题.给出一串数列,求最大的子段和.我们举个栗子.7123-543-6这个样例的答案是8,前6个数相加是最大的.显然本题是一个dp了.定义dp[i]为以第i个数结尾的最大子段和,最后把dp[1
ton
Fuko_Ibuki
·
2020-08-20 00:59
dp
前缀和
leetcode 390. Elimination Game 消除游戏 + 递归解决 + 寻找规律
Thereisalistofsortedintegersfrom1
ton
.Startingfromlefttoright,removethefirstnumberandeveryothernumberafterwarduntilyoureachtheendofthelist.Repeatthepreviousstepagain
JackZhangNJU
·
2020-08-19 23:27
leetcode
For
C++
leetcode
For
Java
DFS深度优先搜索
需要好好想一下的题目
1109. Corporate Flight Bookings
Therearenflights,andtheyarelabeledfrom1
ton
.Wehavealistofflightbookings.Thei-thbookingbookings[i]=[i,j
katrina95
·
2020-08-19 18:56
running
sum
poj 3187 Backward Digit Sums 【全排列变形题】
65536KTotalSubmissions:5356Accepted:3093DescriptionFJandhiscowsenjoyplayingamentalgame.Theywritedownthenumbersfrom1
toN
dxx_111
·
2020-08-19 09:06
dfs
poj
Telegram区块链网络将与以太坊兼容
它将允许以太坊社区将他们为以太坊所开发的一切都纳入
TON
网络。”
Echo LI
·
2020-08-19 08:34
[洛谷]P1118 [USACO06FEB]数字三角形 (#搜索)
题目描述FJandhiscowsenjoyplayingamentalgame.Theywritedownthenumbersfrom11
toN
(1\leN\le10)N(1≤N≤10)inacertainorderandthensumadjacentnumberstoproduceanewlistwithonefewernumber.Theyrepeatthisuntilonlyasinglen
Apro1066
·
2020-08-19 07:47
洛谷原创
搜索
搜索----dfs/bfs
USACO
数字三角形（洛谷-P1118）
题目描述FJandhiscowsenjoyplayingamentalgame.Theywritedownthenumbersfrom11
toN
(1≤N≤10)inacertainorderandthensumadjacentnumberstoproduceanewlistwithonefewernumber.Theyrepeatthisuntilonlyasinglenumberisleft.F
Alex_McAvoy
·
2020-08-19 07:11
#
洛谷
#
搜索——DFS
的剪枝
洛谷 P1118 [USACO06FEB]数字三角形Backward Digit Su…
题目描述FJandhiscowsenjoyplayingamentalgame.Theywritedownthenumbersfrom1
toN
(1<=N<=10)inacertainorderandthensumadjacentnumberstoproduceanewlistwithonefewernumber.Theyrepeatthisuntilonlyasinglenumberisleft
Amber_lylovely
·
2020-08-19 06:52
暴力
树状数组 题目集合
T1冒泡排序题目描述clj想起当年自己刚学冒泡排序时的经历，不禁思绪万千当年，clj的冒泡排序(伪)代码是这样的:flag=falsewhile(notflag):flag=truefori=0
toN
-
AK Monster
·
2020-08-19 06:31
树
洛谷 P1118 [USACO06FEB] 数字三角形Backward Digit Su…
题目描述FJandhiscowsenjoyplayingamentalgame.Theywritedownthenumbersfrom1
toN
(1intn,m,a[13],c1[13],c2[13],flag
ShinyaLicone
·
2020-08-19 06:59
洛谷
dfs/bfs
leetcode 565 （高级编程技术week9-2）
leetcode.com/problems/array-nesting/description/题目Azero-indexedarrayAoflengthNcontainsallintegersfrom0
toN
wyfwyf12321
·
2020-08-18 18:23
高级编程技术
最短路径：Shortest Reach
Givenanundirectedgraphconsistingofnodes(labelled1
toN
)whereaspecificgivennoderepresentsthestartpositionandanedgebetweenanytwonodesisoflengthunitsinthegraph.Itisrequiredtocalculatetheshortestdistancefro
vanquishedzxl
·
2020-08-18 17:06
算法
MFC的学习路线
spm=a230r.1.14.13.138af21
ToN
2lN&id=558123872836&ad_id=&am_id=&cm_id=140105335569ed
xunhanliu
·
2020-08-18 16:45
spoj Count on a tree【主席树+在线LCA】
10628.CountonatreeProblemcode:COTYouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
MissZhou要努力
·
2020-08-18 10:30
—数据结构
———特殊树
—图论
———其他图论
[SPOJ-COT]Count on a tree
[SPOJ-COT]Countonatree题面YouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
weixin_34162695
·
2020-08-18 09:11
SPOJ-COT2 Count on a tree II(树上莫队)
YouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
RJ28
·
2020-08-18 09:45
ACM
离散化
好题
离线算法
SPOJ COT2
【标签】离散化，数据结构，分治，图论【题意】YouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperfromthefollowingoperation
SMIAMS
·
2020-08-18 09:06
SPOJ
Count on a tree SPOJ - COT（树上差分+lca+主席树）
YouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
starlet_kiss
·
2020-08-18 09:08
Educational Codeforces Round 89 (Rated for Div. 2) C. Palindromic Paths
C.PalindromicPathstimelimitpertest1.5secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputYouaregivenamatrixwithnrows(numberedfrom1
ton
柠檬咕咕咕
·
2020-08-18 09:58
HDU 4614 Vases and Flowers （二分查找+线段树区间更新）
Aliceissopopularthatshecanreceivemanyflowerseveryday.ShehasNvasesnumberedfrom0
toN
-1.Whenshereceivesomeflowers
i-unique
·
2020-08-18 09:54
ACM
数据结构
线段树
二分
三分
线段树-------L - Vases and Flowers（简单线段树 + 二分）
Aliceissopopularthatshecanreceivemanyflowerseveryday.ShehasNvasesnumberedfrom0
toN
-1.Whenshereceivesomeflowers
ZhangJiangYu666
·
2020-08-18 09:47
ACM__线段树
SPOJ - COT Count on a tree [LCA+主席树]【数据结构】
————————————————————————COT-Countonatree#treeYouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyouto
Tabris_
·
2020-08-18 09:05
SPOJ
====
数据结构
====
思维
11212 - Editing a Book
ProblemEEditingaBookYouhavenequal-lengthparagraphsnumbered1
ton
.Nowyouwanttoarrangethemintheorderof1,2
hyqsblog
·
2020-08-18 08:56
UVa
搜索
Okabe and Boxes(栈)
题目：OkabeandSuperHackerDaruarestackingandremovingboxes.Therearenboxesnumberedfrom1
ton
.Initiallytherearenoboxesonthestack.Okabe
偷吃了老鼠的土豆
·
2020-08-18 08:02
数据结构
HDU4614--线段树+二分
题目：VasesandFlowersAliceissopopularthatshecanreceivemanyflowerseveryday.ShehasNvasesnumberedfrom0
toN
-1
偷吃了老鼠的土豆
·
2020-08-18 08:02
二分
数据结构-线段树
codeforces821 C（栈操作）
C.OkabeandBoxestimelimitpertest3secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputOkabeandSuperHackerDaruarestackingandremovingboxes.Therearenboxesnumberedfrom1
ton
.Initiallyth
童话ing
·
2020-08-18 08:35
Codeforces
hdu 4614 Vases and Flowers（线段树+二分）
VasesandFlowersProblemDescriptionAliceissopopularthatshecanreceivemanyflowerseveryday.ShehasNvasesnumberedfrom0
toN
Alzh
·
2020-08-18 08:07
二分
线段树
思路题
ACM
L - Vases and Flowers HDU - 4614（线段树）
ProblemDescriptionAliceissopopularthatshecanreceivemanyflowerseveryday.ShehasNvasesnumberedfrom0
toN
-1
god_alonely
·
2020-08-18 08:24
线段树
SPOJ-COT-Count on a tree
COT-CountonatreeYouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
algzjh
·
2020-08-18 08:47
#
主席树等各种树
UVA - 11212 Editing a Book : IDA*
题目点此跳转Youhavenequal-lengthparagraphsnumbered1
ton
.Nowyouwanttoarrangethemintheorderof1,2,…,n.Withthehelpofaclipboard
_duadua
·
2020-08-18 08:06
搜索
算法竞赛入门经典(紫书)
SPOJ10628--COT（树上第K大）主席树
YouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
SCUT_Pein
·
2020-08-18 08:06
图论_LCA
数据结构_主席树
Okabe and Boxes（CodeForces - 821C ）（模拟栈）
C.OkabeandBoxestimelimitpertest3secondsmemorylimitpertest256megabytesinputstandardinputoutputstandardoutputOkabeandSuperHackerDaruarestackingandremovingboxes.Therearenboxesnumberedfrom1
ton
.Initiallyth
Z_sea
·
2020-08-18 08:30
题库
HDU 6031 Innumerable Ancestors (二分+树上倍增)
TotalSubmission(s):1854AcceptedSubmission(s):647ProblemDescriptionThereisatreehavingnnodes,labeledfrom1
ton
_TCgogogo_
·
2020-08-18 08:42
ACM
二分/三分/两点法
图论
算法题
Codeforces#420 C. Okabe and Boxes
C.OkabeandBoxesOkabeandSuperHackerDaruarestackingandremovingboxes.Therearenboxesnumberedfrom1
ton
.Initiallytherearenoboxesonthestack.Okabe
cyl纤云弄巧
·
2020-08-18 08:07
Codeforces
---数据结构---
SPOJ COT2 Count on a tree II
YouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
ShinyaLicone
·
2020-08-18 08:35
其它OJ
莫队算法
倍增
SPOJ - COT Count on a tree 树上主席树+LCA+任意路径问题
CountonatreeSPOJ-COTYouaregivenatreewithNnodes.Thetreenodesarenumberedfrom1
toN
.Eachnodehasanintegerweight.Wewillaskyoutoperformthefollowingoperation
ProLightsfxjh
·
2020-08-18 08:58
SPOJ
算法的艺术
ACM
树上主席树
LCA
任意路径问题
可持久化线段树
Vases and Flowers HDU - 4614（线段树区间更新）
Aliceissopopularthatshecanreceivemanyflowerseveryday.ShehasNvasesnumberedfrom0
toN
-1.Whenshereceivesomeflowers
浮生一朝
·
2020-08-18 07:00
线段树
HDU 6031 Innumerable Ancestors （LCA）
Thereisatreehavingnnodes,labeledfrom1
ton
.Therootofthetreeisalways1,andthedepthofanodepisthenumberofnodesontheshortestpathbetweennodepandtheroot.Incomputerscience
ffutop
·
2020-08-18 07:56
HDU
LCA
上一页
5
6
7
8
9
10
11
12
下一页
按字母分类：
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他