bzoj1651: [Usaco2006 Feb]Stall Reservations 专用牛棚

最新推荐文章于 2020-03-07 16:44:12 发布

Cynthia_wjyi

最新推荐文章于 2020-03-07 16:44:12 发布

阅读量526

点赞数

分类专栏：差分约束 usaco silver

本文链接：https://blog.csdn.net/cynthia_wjyi/article/details/49404311

版权

usaco silver 同时被 2 个专栏收录

27 篇文章 0 订阅

订阅专栏

差分约束

2 篇文章 0 订阅

订阅专栏

1651: [Usaco2006 Feb]Stall Reservations 专用牛棚

Time Limit: 10 Sec Memory Limit: 64 MB
Submit: 663 Solved: 369
[ Submit][ Status][ Discuss]

Description

Oh those picky N (1 <= N <= 50,000) cows! They are so picky that each one will only be milked over some precise time interval A..B (1 <= A <= B <= 1,000,000), which includes both times A and B. Obviously, FJ must create a reservation system to determine which stall each cow can be assigned for her milking time. Of course, no cow will share such a private moment with other cows. Help FJ by determining: * The minimum number of stalls required in the barn so that each cow can have her private milking period * An assignment of cows to these stalls over time

有N头牛,每头牛有个喝水时间,这段时间它将专用一个Stall 现在给出每头牛的喝水时间段,问至少要多少个Stall才能满足它们的要求

Input

* Line 1: A single integer, N

* Lines 2..N+1: Line i+1 describes cow i's milking interval with two space-separated integers.

Output

* Line 1: The minimum number of stalls the barn must have.

* Lines 2..N+1: Line i+1 describes the stall to which cow i will be assigned for her milking period.

Sample Input

5
1 10
2 4
3 6
5 8
4 7

Sample Output

4

OUTPUT DETAILS:

Here's a graphical schedule for this output:

Time 1 2 3 4 5 6 7 8 9 10
Stall 1 c1>>>>>>>>>>>>>>>>>>>>>>>>>>>
Stall 2 .. c2>>>>>> c4>>>>>>>>> .. ..
Stall 3 .. .. c3>>>>>>>>> .. .. .. ..
Stall 4 .. .. .. c5>>>>>>>>> .. .. ..

Other outputs using the same number of stalls are possible.

HINT

不妨试下这个数据,对于按结束点SORT,再GREEDY的做法 1 3 5 7 6 9 10 11 8 12 4 13 正确的输出应该是3

Source

Silver

题解：又见差分约束。不用的话要写线段树哦。

<span style="font-size:18px;">#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int n,a[1000005];
int main()
{
    n=read();
    int m=0,x,y;
    for(int i=1;i<=n;i++)
    {
    	x=read();y=read();
    	a[x]+=1;a[y+1]-=1;
    	m=max(m,y);
    }
    ll now=0,ans=0;
    for(int i=1;i<=m;i++)
    {
    	now+=a[i];
    	ans=max(ans,now);
    }
    cout<<ans<<endl;
}</span>