poj 2528(贴海报)矩形分割。
来源:互联网 发布:华为云计算部门待遇 编辑:程序博客网 时间:2024/05/17 00:13
Mayor's posters
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 42072 Accepted: 12257
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
#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <iostream>#include <cmath>#include <queue>#include <map>#include <stack>#include <list>#include <vector>#define LL __int64struct node{int l,r,ans;}f[10010];using namespace std;int n; void cover(int l,int r,int now,int k){while (k<n && (f[k].l>r || f[k].r<l)) //now的上面没有覆盖到now k++;if (k>=n){f[now].ans+=r-l+1;return;}if (l<f[k].l)cover(l,f[k].l-1,now,k+1);if (r>f[k].r)cover(f[k].r+1,r,now,k+1);}int main(){int T;scanf("%d",&T);while (T--){memset(f,0,sizeof(f));int s=0,i;scanf("%d",&n);for (i=0;i<n;i++)scanf("%d%d",&f[i].l,&f[i].r);for (i=n-1;i>=0;i--){cover(f[i].l,f[i].r,i,i+1);if (f[i].ans>0) s++;}cout<<s<<endl;}return 0;}
0 0
- poj 2528(贴海报)矩形分割。
- poj 2528 贴海报
- poj 2528/3277 线段树(海报覆盖)
- 直方图内最大矩形 (最大矩形面积、贴海报、动态规划)
- 矩形分割
- 矩形分割
- 分割矩形
- POJ 2528 Mayor's posters(离散化 线段树 贴海报)
- poj 2528 Mayor's posters(线段树 离散化 区间更新 贴海报)
- POJ 2528(市长的海报)线段树+离散化
- [贪心] 矩形分割
- <模板> 矩形分割
- sgu177:Square(矩形分割)
- 【TYVJ】1094 矩形分割
- P1094 矩形分割|tyvj
- 【tyvj1094】矩形分割 贪心
- 二分-矩形分割
- NOI-OJ矩形分割
- 动画机制全解析
- 题目:请实现两棵树是否相等的比较,相等返回,否则返回其他值,并说明算法复杂度。
- 2013华为上机题C++编程
- 视频处理
- Java中文乱码处理
- poj 2528(贴海报)矩形分割。
- Animator
- 有一个数组,数组中有13个元素,先将该数组进行分组,每3个元素为一组,分为若干组,最后用一个数组统一管理这些分组.(要动态创建数组).
- 开关三极管(数电中 三极管工作在截止区和导通区,模电中工作在放大区)
- 在 VS14 上安装 PowerShell Tools for VS 2013
- 如何向mysql中插入大量数据
- 实现2个超大数的加法运算
- HDOJ 1058 Humble Numbers(基础DP方程)
- Oracle WorkFlow(工作流)(一)