/*
Problem H
Time Limit: 1000MS Memory limit: 65536K
题目描述
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:
(1)Every candidate can place exactly one poster on the wall.
(2)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).
(3)The wall is divided into segments and the width of each segment is one byte.
(4)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.
输入
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.
输出
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.
示例输入
1
5
1 4
2 6
8 10
3 4
7 10
示例输出
4
*/
/*
///sdutoj1900题
///解题思路:1 2 3 4 5 6 7 8 9 10
------------------- ------------------
----------------------- ------------------
------ ----------------------
用数组模拟覆盖的颜色种类,并进行更改;
然后在用一数组计数最后所剩的颜色种类;
#include<cstdio>
#include<cstring>
using namespace std;
int vis[10000000];
int main()
{
int num[10000];
int t;
int n;
scanf("%d",&t);
while(t--)
{
memset(num,0,sizeof(num));
int x,y;
int q=1;
scanf("%d",&n);
int mx=-1;
for(int i=0; i<n; i++ )
{
scanf("%d%d",&x,&y);
if(mx<x)mx=x;
if(mx<y)mx=y;
for(int j=x; j<=y; j++)
{
vis[j]=q;
}
q++;
}
for(int i=1; i<=mx; i++)
{
num[vis[i]]++;
}
int sum=0;
for(int i=1;i<=q;i++)
{
if(num[i]>0)sum++;
}
printf("%d\n",sum);
}
return 0;
}
Problem H
Time Limit: 1000MS Memory limit: 65536K
题目描述
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:
(1)Every candidate can place exactly one poster on the wall.
(2)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).
(3)The wall is divided into segments and the width of each segment is one byte.
(4)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.
输入
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.
输出
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.
示例输入
1
5
1 4
2 6
8 10
3 4
7 10
示例输出
4
*/
/*
///sdutoj1900题
///解题思路:1 2 3 4 5 6 7 8 9 10
------------------- ------------------
----------------------- ------------------
------ ----------------------
用数组模拟覆盖的颜色种类,并进行更改;
然后在用一数组计数最后所剩的颜色种类;
*/
代码:
#include <iostream>#include<cstdio>
#include<cstring>
using namespace std;
int vis[10000000];
int main()
{
int num[10000];
int t;
int n;
scanf("%d",&t);
while(t--)
{
memset(num,0,sizeof(num));
int x,y;
int q=1;
scanf("%d",&n);
int mx=-1;
for(int i=0; i<n; i++ )
{
scanf("%d%d",&x,&y);
if(mx<x)mx=x;
if(mx<y)mx=y;
for(int j=x; j<=y; j++)
{
vis[j]=q;
}
q++;
}
for(int i=1; i<=mx; i++)
{
num[vis[i]]++;
}
int sum=0;
for(int i=1;i<=q;i++)
{
if(num[i]>0)sum++;
}
printf("%d\n",sum);
}
return 0;
}