Mayor's posters--------线段树
来源:互联网 发布:网络用语kpi什么意思 编辑:程序博客网 时间:2024/06/09 16:21
http://acm.pku.edu.cn/JudgeOnline/problem?id=2528
Mayor's posters 438ms
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 15106 Accepted: 4224
Description
The citizens of Bytetown, AB, could not stand that the candidates in the mayoral election campaign have been placing their electoral posters at all places at their whim. The city council has finally decided to build an electoral wall for placing the posters and introduce the following rules:
They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.
- Every candidate can place exactly one poster on the wall.
- All posters are of the same height equal to the height of the wall; the width of a poster can be any integer number of bytes (byte is the unit of length in Bytetown).
- The wall is divided into segments and the width of each segment is one byte.
- Each poster must completely cover a contiguous number of wall segments.
They have built a wall 10000000 bytes long (such that there is enough place for all candidates). When the electoral campaign was restarted, the candidates were placing their posters on the wall and their posters differed widely in width. Moreover, the candidates started placing their posters on wall segments already occupied by other posters. Everyone in Bytetown was curious whose posters will be visible (entirely or in part) on the last day before elections.
Your task is to find the number of visible posters when all the posters are placed given the information about posters' size, their place and order of placement on the electoral wall.
Input
The first line of input contains a number c giving the number of cases that follow. The first line of data for a single case contains number 1 <= n <= 10000. The subsequent n lines describe the posters in the order in which they were placed. The i-th line among the n lines contains two integer numbers li and ri which are the number of the wall segment occupied by the left end and the right end of the i-th poster, respectively. We know that for each 1 <= i <= n, 1 <= li <= ri <= 10000000. After the i-th poster is placed, it entirely covers all wall segments numbered li, li+1 ,... , ri.
Output
For each input data set print the number of visible posters after all the posters are placed.
The picture below illustrates the case of the sample input.
The picture below illustrates the case of the sample input.
Sample Input
151 42 68 103 47 10
Sample Output
4
- Mayor's posters--------线段树
- Poj2528 Mayor's posters (线段树)
- 【线段树+离散化】Mayor's Posters
- POJ-2528 Mayor's posters 线段树
- 线段树+离散化Mayor's posters
- 【线段树】poj 2528 Mayor's posters
- POJ 2528 Mayor's posters 线段树
- Poj 2528 Mayor's posters - 线段树
- poj2528 Mayor's posters 【线段树】
- POJ 2528 Mayor's posters 线段树
- POJ-2528-Mayor's posters(线段树)
- POJ2528 Mayor's posters线段树
- poj 2528 Mayor's posters 线段树
- uva 10587 - Mayor's posters(线段树)
- POJ - 2528 Mayor's posters(线段树)
- POJ2528 Mayor's posters 线段树
- POJ Mayor's posters 线段树
- poj 2528 Mayor's posters 线段树
- 新人的忠告——学会自我解决问题
- 列出Android设备中所有启动的服务
- 4、虽然是小成本投入
- 用笔记本破解无线路由器密码
- (StreamReader.ReadLine()==null)还是(-1 != StreamReader.Peek())?
- Mayor's posters--------线段树
- 职业生涯的红色警报
- 关于tss中的link
- 性能优化总结的一点回复
- cannot open file "mfc42u.lib"的解决方案
- 有做个.NET的手机客户端平台的吗
- 大脑的记忆与存储技术(2007
- 使用JFlex、JavaCUP
- windows下修改eclipse的默认编码 【转】