poj2777 Count Color
来源:互联网 发布:2003表格重复数据标记 编辑:程序博客网 时间:2024/05/22 13:12
Description
There is a very long board with length L centimeter, L is a positive integer, so we can evenly divide the board into L segments, and they are labeled by 1, 2, ... L from left to right, each is 1 centimeter long. Now we have to color the board - one segment with only one color. We can do following two operations on the board:
1. "C A B C" Color the board from segment A to segment B with color C.
2. "P A B" Output the number of different colors painted between segment A and segment B (including).
In our daily life, we have very few words to describe a color (red, green, blue, yellow…), so you may assume that the total number of different colors T is very small. To make it simple, we express the names of colors as color 1, color 2, ... color T. At the beginning, the board was painted in color 1. Now the rest of problem is left to your.
Input
Output
Ouput results of the output operation in order, each line contains a number.
题解:
令线段树节点定义为: l,r,value,flag分被表示区间左右端点,该区间的涂色为value,flag为标记量,true表示该区间涂色为最新的涂色,否则表示该区间的子区间有更新的涂色。由于初始时均涂色为1,故value的值均为1,flag均为true(即都是最新的涂色)。本题的难点在于更新和查找。
代码:
with tree[p] do
begin
if (l=b) and (r=e) then
begin
color:=1 shl (c-1);
cover:=true;
exit;
end;
if cover then
begin
cover:=false;
tree[p*2].cover:=true;
tree[p*2].color:=color;
tree[p*2+1].cover:=true;
tree[p*2+1].color:=color;
end;
m:=(l+r) div 2;
if e<=m then ins(p*2,b,e,c) else
if b>m then ins(p*2+1,b,e,c) else
begin
ins(p*2,b,m,c);
ins(p*2+1,m+1,e,c);
end;
color:=tree[p*2].color or tree[p*2+1].color;
end;
- Count Color[poj2777]
- poj2777 Count Color
- poj2777 Count Color
- POJ2777--Count Color
- POJ2777 Count Color
- POJ2777 Count Color
- poj2777:Count Color
- poj2777 Count Color
- poj2777 Count Color
- poj2777 Count Color
- poj2777 Count Color
- POJ2777-Count Color
- 【poj2777】Count Color
- poj2777-Count Color
- poj2777——Count Color
- POJ2777 Count Color 线段树
- 【poj2777】【线段树】Count Color
- [poj2777 Count Color]线段树
- GCC的基本用法
- 第一篇博文--自我介绍
- Warp : Haskell 的高性能 Web 服务器(译文)
- stack的功能
- 第110课: Spark Streaming电商广告点击综合案例通过updateStateByKey等实现广告点击流量的在线更新统计
- poj2777 Count Color
- TS流打包总结
- 什么是一阶逻辑(First-order Logic)
- tushare金融数据
- 视图
- memched1.0源码阅读(3)——运行流程
- GCC编译和GDB调试
- Easy-题目45:58. Length of Last Word
- [Maven]5,相关配置