Vmorish

—— Anything is possible

排序:
默认
按更新时间
按访问量

HDU - 5489 Removed Interval (dp+线段树) 2015合肥网络赛

HDU - 5489 Removed Interval (dp+线段树) 2015合肥网络赛Problem Description Given a sequence of numbers A=a1,a2,…,aN, a subsequence b1,b2,…,bk of A is referred...

2017-09-13 12:55:26

阅读数:297

评论数:0

HDU - 6183 Color it(线段树)

HDU - 6183 Color it(线段树) Problem Description Do you like painting? Little D doesn't like painting, especially messy color paintings. Now Little B is ...

2017-09-07 15:02:27

阅读数:172

评论数:0

POJ - 2155 Matrix(二维线段树)

POJ - 2155 Matrix(二维线段树) Description Given an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th colu...

2017-08-09 19:38:14

阅读数:130

评论数:0

HDU - 4267 A Simple Problem with Integers(线段树)

HDU - 4267 A Simple Problem with Integers(线段树) Problem Description Let A1, A2, ... , AN be N elements. You need to deal with two kinds of operations....

2017-08-09 15:47:07

阅读数:134

评论数:0

HDU - 1542 Atlantis(线段树扫描线求矩形并的面积)

HDU - 1542 Atlantis(线段树扫描线求矩形并的面积) 线段树求矩形面积详解 Problem Description There are several ancient Greek texts that contain descriptions of the fabled islan...

2017-08-09 11:46:00

阅读数:382

评论数:0

(2017多校4)1004/hdu-6070 Dirt Ratio(二分 + 线段树)

(2017多校4)1004/hdu-6070 Dirt Ratio(二分 + 线段树) Problem Description In ACM/ICPC contest, the ''Dirt Ratio'' of a team is calculated in the following way....

2017-08-04 10:44:59

阅读数:95

评论数:0

POJ - 2777 Count Color(线段树 成段更新 区间查询)

POJ 2777 Count Color(线段树 成段更新 区间查询) Description Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds...

2017-08-01 08:49:32

阅读数:145

评论数:0

POJ - 3667 Hotel(线段树 区间合并 区间查询)

POJ 3667 Hotel(线段树 区间合并 区间查询) The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny sh...

2017-07-31 21:06:17

阅读数:114

评论数:0

HDU - 1394 Minimum Inversion Number(线段树 单点更新 区间查询)

HDU 1394 Minimum Inversion Number(线段树 单点更新 区间查询) The inversion number of a given number sequence a1, a2, ..., an is the number of pairs (ai, aj) that...

2017-07-31 17:08:19

阅读数:97

评论数:0

HDU - 2795 Billboard(线段树 单点更新 最值问题)

HDU - 2795 Billboard(线段树 单点更新 最值问题) Problem Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is i...

2017-07-31 16:53:33

阅读数:145

评论数:0

POJ - 2750 Potted Flower(线段树的区间合并)

点我看题 题意:给你一个环,实时更新环上某个结点的值,让你找出连续和的最大值(不能包括所有数) 分析:线段树的区间合并 参考代码: #include #include #include #include #include using namespace std; #define ls r...

2017-07-24 15:16:51

阅读数:111

评论数:0

POJ - 3468 A Simple Problem with Integers(线段树)

本来准备下一阶段再看看线段树的,想了解一下Splay,但是匡斌的博客刚好以这个题为例讲Splay,然后就先用线段树写了这个题写了这个题... 题意:区间更新,区间求和. 分析:直接套模板吧,但是要注意数据范围,改用long long千万不要用int的哇. 参考代码: #in...

2017-07-24 10:04:15

阅读数:73

评论数:0

HDU - 2795 Billboard(线段树,单点更新,最值问题)

Description At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is t...

2017-07-03 10:55:14

阅读数:143

评论数:0

HDU-1166 敌兵布阵 (树状数组 or 线段树)

Description C国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个...

2017-07-02 19:06:07

阅读数:150

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭