Integer Intervals
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 14484 | Accepted: 6153 |
Description
An integer interval [a,b], a < b, is a set of all consecutive integers beginning with a and ending with b.
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.
Write a program that: finds the minimal number of elements in a set containing at least two different integers from each interval.
Input
The first line of the input contains the number of intervals n, 1 <= n <= 10000. Each of the following n lines contains two integers a, b separated by a single space, 0 <= a < b <= 10000. They are the beginning and the end of an interval.
Output
Output the minimal number of elements in a set containing at least two different integers from each interval.
Sample Input
4 3 6 2 4 0 2 4 7
Sample Output
4
Source
题目大意:
这道题的意思是 finds the minimal number of elements in a set containing at least two different integers from each interval. 0 1 2 3 4 5 6 7 ----- (0 to 2) ----- (2 to 4) ------- (3 to 6) ------- (4 to 7) 包含上面集合的至少两个元素的集合??? 这里需要的最小的集合是(1,2,4,5) or (1,2,4,6) 注意这里的集合不需要是连续的数字,题目只要求出这种集合的元素个数, 所以输出:4解题思路:
先对所有区间按末端点排序(贪心)
取第i个区间的最后两个元素Selem和Eelem
若第i+1个区间包含了这两个元素,则跳到下一个区间所取的元素个数+0
若第i+1个区间只包含了这两个元素中的一个(由于有序,所以必定是包含Eelem),则取第i+1个区间的最后一个元素,所取的元素个数+1。为了方便下一区间的比较,更新Selem和Eelem的值,Selem变成此时的Eelem(贪心,尽量使数量少),Eelem变成当前区间的右端点。
若第i+1个区间没有包含这两个元素,则第i+1个区间的最后两个元素,所取的元素个数+2。为了方便下一区间的比较,更新Selem和Eelem的值,使他们为当前V集合中最后的两个元素。
Selem初始化为第一个区间的最后倒数第2个元素
Eelem初始化为第一个区间的最后的元素
所取的元素个数初始化为2 (就是Selem和Eelem)
代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct node
{
int l,r;
}qu[10010];
bool cmp(struct node a,struct node b)
{
return a.r<b.r;
}
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d%d",&qu[i].l,&qu[i].r);
}
sort(qu,qu+n,cmp);
int z=qu[0].r-1,y=qu[0].r;
int ans=2;//初始化
for(int i=1;i<n;i++)
{
if(z>=qu[i].l)//z,y在当前区间内,所以不更新
{
continue;
}
if(z<qu[i].l&&y>=qu[i].l)//一个在区间内一个不在
{
z=y;//贪心,使得数量尽量少
y=qu[i].r;
ans++;
}
else//两个都不在当前区间
{
z=qu[i].r-1;
y=qu[i].r;
ans=ans+2;
}
}
printf("%d\n",ans);
return 0;
}