- 博客(10)
- 收藏
- 关注
原创 HDU - 4614 Vases and Flowers —— 线段树 二分
Vases and FlowersTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4540 Accepted Submission(s): 1866 Problem Description Alice is so po...
2018-07-27 20:27:35 166
原创 POJ - 3264 Balanced Lineup —— 线段树 区间差值
Balanced LineupTime Limit: 5000MS Memory Limit: 65536K Total Submissions: 62682 Accepted: 29231 Case Time Limit: 2000MS DescriptionFor the daily milking, Farmer John's N cow...
2018-07-27 20:15:35 255
原创 HDU - 1796 How many integers can you find
How many integers can you findTime Limit: 12000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10302 Accepted Submission(s): 3078 Problem Description ...
2018-07-27 20:09:53 156
原创 HDU - 2204 Eddy's爱好
Eddy's爱好Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2927 Accepted Submission(s): 1434 Problem DescriptionIgnatius 喜欢收集蝴蝶标本和邮票,但是Ed...
2018-07-27 20:03:37 169
原创 POJ - 2029 Get Many Persimmon Trees —— 二维线段树 点更新区间查询
Get Many Persimmon TreesTime Limit: 1000MS Memory Limit: 30000K Total Submissions: 4822 Accepted: 3140 DescriptionSeiji Hayashi had been a professor of the Nisshinkan Samurai ...
2018-07-27 19:31:24 197
原创 POJ - 1195 Mobile phones —— 二维线段树 区间更新点查询
Mobile phonesTime Limit: 5000MS Memory Limit: 65536K Total Submissions: 21877 Accepted: 10176 DescriptionSuppose that the fourth generation mobile phone base stations in the T...
2018-07-27 19:28:16 334
原创 HDU - 1823 Luck and Love —— 二维线段树 区间查询点更新
Luck and LoveTime Limit: 10000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8470 Accepted Submission(s): 2190 Problem Description世界上上最远的距离不是相隔天涯海角而...
2018-07-27 19:24:22 283
原创 ZOJ - 2859 Matrix Searching —— 二维线段树
Matrix SearchingTime Limit: 10 Seconds Memory Limit: 32768 KBGiven an n*n matrix A, whose entries Ai,j are integer numbers ( 1 <= i <= n, 1 <= j <= n ). An operation FIND the min...
2018-07-27 19:18:35 230
原创 POJ - 2155 Matrix —— 二维线段树
MatrixTime Limit: 3000MS Memory Limit: 65536K Total Submissions: 32486 Accepted: 11776 DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the num...
2018-07-27 19:15:08 174
原创 二维线段树
一维线段树用来维护一维的空间,即一个线段。二维线段树用来维护二维的空间,即一个矩形。 二维线段树的每个结点都是一棵一维线段树,所以结构体数组要开二维,再加上线段树本身的性质,会占用很大内存,要尽量减少结构体内存储的值的个数和长度,考虑到每个节点表示的线段的左右端点可以作为函数参数,所以不再储存在结构体内部,若题目只需保存一个值,完全可以只开一个数组而不使用结构体。第一维树维护...
2018-07-27 19:10:06 1901 2
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人