经典线段树 UVALive 3938/UVA 1400

【经典线段树 UVALive 3938/UVA 1400】的更多相关文章

经典线段树 UVALive 3938/UVA 1400

题意:就是相当于动规里面的求最大连续子串,不同的是,这里需要读入一个区间x,y,输出的区间 a,b 且x<=a<=b<=y,使得a b的连续子串最长,而且询问次数达到了10的五次方. 我是在大白书上看到这个题,一开始想简单了,就照着刘汝佳的思路写,线段树里只存了前缀最大和,后缀最大和,总最大和,但题目要求输出区间,明显的需要添加记录维护区间位置的,而且不止要存储 a,b,还要存pre suf,前缀后缀的边界位置.我第一次写的时候意识到了,但是那个时候已经有点混乱了,我以为在查询的时候,…

ZOJ - 1610 经典线段树染色问题

这个是一个经典线段树染色问题,不过题目给的是左右左右坐标,即[0,3]包含0-1这一段 1-2这一段 2-3这一段,和传统的染色不太一样,不过其实也不用太着急. 我们把左边的坐标+1,即可,那么[0,3]其实变成了[1,3]而线段树是按照点询问的,也就是每个点代表的颜色,我们就有了1,2,3,这个三个,并且避免了线段树编号不能到0的情况,然后代码就十分简单了,无需laze标记,因为每个节点的颜色就可以当成laze标记,然后不断往下pushdown既可以,当时还有一个问题就是线段树访问连续两个节点…

pku 2777(经典线段树染色问题)

Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 41202 Accepted: 12458 Description Chosen Problem Solving and Program design as an optional course, you are required to solve all kinds of problems. Here, we get a new problem.…

poj-2828 Buy Tickets(经典线段树)

/* Buy Tickets Time Limit: 4000MS Memory Limit: 65536K Total Submissions: 10207 Accepted: 4919 Description Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue… The Lunar New Year was…

poj 2528 poster经典线段树+lazy+离散化

#include<cstdio> #include<cstring> #include<algorithm> using namespace std; ; #define lson l,m,rt<<1 #define rson m+1,r,rt<<1|1 ];int flag[maxn]; ]; ; int trans(int num,int l,int r) { // int m=(l+r)>>1; // if(num==x[m])…

ZOJ1610(经典线段树涂色问题)

Description Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones. Your task is counting the segments of different colors you can see at last. Input The first line of each data set conta…