线段树
关注
分享
扫一扫
文章平均质量分 89
键盘里的青春
加油~
展开
-
POJ 2352_Stars && POJ-2481 Cows （线段树单点更新+树状数组）
C - CowsTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 2481DescriptionFarmer John's cows have discovered that the clover g原创 2016-09-26 20:13:56 · 654 阅读 · 0 评论 -
HDU 5875 Function (ST表+二分 or 线段树)
Problem Description The shorter, the simpler. With this problem, you should be convinced of this truth. You are given an array A of N postive integers, and M queries in the form (l,r).原创 2017-09-03 14:18:15 · 352 阅读 · 0 评论 -
HDU 5726 GCD （rmq+二分 or 线段树 维护区间gcd）
GCDTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4325 Accepted Submission(s): 1543Problem DescriptionGive you a sequence o原创 2017-09-19 17:30:01 · 601 阅读 · 0 评论 -
2017 华东师范大学网赛 F.丽娃河的狼人传说 && Problem #3263( 贪心)
丽娃河的狼人传说Time limit per test: 1.0 secondsTime limit all tests: 1.0 secondsMemory limit: 256 megabytes丽娃河是华师大著名的风景线。但由于学校财政紧缺，丽娃河边的路灯年久失修，一到晚上就会出现走在河边要打着手电的情况，不仅非常不方便，而且影响安全：已经发生了大大小小的原创 2017-05-15 17:11:27 · 1462 阅读 · 0 评论 -
nyoj 856 华山论剑 （并查集or线段树区间点更新）
华山论剑时间限制：1000 ms | 内存限制：65535 KB难度：3描述有n个剑客（编号1~n）相约华山比剑，分 m 次决斗，为了节省时间，每次决斗 编号在[l,r]的剑客一起决斗，然后xi获胜。当进行下一次决斗，失败后的剑客可能再参与到决斗，m 次决斗后可能不止一位获胜者（没有失败过就视为获胜者）。输入多组测试数据。对于每组测试数据原创 2017-05-18 17:21:47 · 498 阅读 · 0 评论 -
POJ 2182 Lost Cows 题解 （线段树维护区间变化or暴力）
Lost CowsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 11625 Accepted: 7472DescriptionN (2 <= N <= 8,000) cows have unique brands in the range 1..N.原创 2017-03-15 10:20:09 · 937 阅读 · 0 评论 -
HDU 4027 Can you answer these queries? 题解（思维+线段树区间更新）
Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 15021 Accepted Submission(s): 3526Problem Descriptio原创 2017-03-15 10:07:55 · 630 阅读 · 0 评论 -
Zoj 1610 Count the Colors 详细题解（区间染色，求染色段）
Count the ColorsTime Limit: 2 Seconds Memory Limit: 65536 KBPainting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your原创 2017-03-15 09:56:52 · 1098 阅读 · 0 评论 -
POJ 3468 A Simple Problem with Integers（线段树区间更新模板题）
A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 22796Accepted: 6106Case Time Limit: 2000MSDescriptionY原创 2016-12-06 19:59:23 · 585 阅读 · 1 评论 -
POJ 2155 Matrix (二位树状数组）
G - MatrixTime Limit:3000MS Memory Limit:65536KB 64bit IO Format:%lld & %lluSubmit Status Practice POJ 2155Appoint description: System Crawler (Oct 12, 2016 12:35:18 PM)原创 2016-10-13 13:05:33 · 543 阅读 · 0 评论 -
图论姿势总结
Elegant ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1081 Accepted Submission(s): 562Special JudgeProblem Descript原创 2017-09-06 11:35:17 · 536 阅读 · 0 评论