
线段树
文章平均质量分 86
creatorx
这个作者很懒,什么都没留下…
展开
-
hdu4027 线段树单点更新
Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 14924 Accepted Submission(s): 3502Problem Description A lot of原创 2017-03-13 20:46:50 · 304 阅读 · 0 评论 -
864E(dp + 线段树优化)
E. Firetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp is in really serious trouble — his house i原创 2017-09-27 16:54:30 · 340 阅读 · 0 评论 -
HDU6183(线段树)
Color itTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 132768/132768 K (Java/Others)Total Submission(s): 302 Accepted Submission(s): 62Problem DescriptionDo you like pain原创 2017-09-01 12:41:15 · 889 阅读 · 0 评论 -
HDU6155(dp + 线段树区间更新 + 矩阵性质)
Subsequence CountTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 256000/256000 K (Java/Others)Total Submission(s): 304 Accepted Submission(s): 126Problem DescriptionGiven a原创 2017-08-20 20:23:48 · 828 阅读 · 0 评论 -
HDU6070(二分+线段树区间更新)
Dirt RatioTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 1171 Accepted Submission(s): 519 Special JudgeProblem Description In ACM/ICPC原创 2017-08-04 16:46:10 · 384 阅读 · 0 评论 -
HUST1722(线段树维护区间最大连续和)
1722 - East Ninth RoadTime Limit: 2s Memory Limit: 256MB Submissions: 195 Solved: 11 DESCRIPTION Pyy now is in the third year of college and he has a lot of spare time to have fun. So he joined the原创 2017-05-24 16:08:36 · 1004 阅读 · 0 评论 -
codeforces 799C(线段树区间更新)
C. Fountains time limit per test2 seconds memory limit per test256 megabytes inputstandard input outputstandard output Arkady plays Gardenscapes a lot. Arkady wants to build two new fountains. The原创 2017-05-13 10:49:26 · 535 阅读 · 0 评论 -
2017武汉大学校赛网络预选赛d题
Input file: standard input Output file: standard output Time limit: 1 second Memory limit: 512 mebibytes Every year, the ACM/ICPC team will hold many contests, some of them are training while othe原创 2017-04-12 18:03:07 · 709 阅读 · 0 评论 -
hdu3874 线段树单点更新+离线处理
NecklaceTime Limit: 15000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4716 Accepted Submission(s): 1618Problem Description Mery has a beautiful necklace原创 2017-03-14 18:56:28 · 293 阅读 · 0 评论 -
kattis Grid MST (最小曼哈顿生成树)
Grid MSTThis is a very simple problem. You are given NN points. Some points may be repeated. The weight (distance) between two points is given by the Manhattan distance between the two point原创 2017-10-24 17:13:48 · 617 阅读 · 0 评论