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

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

Time Limit: 10 Sec  Memory Limit: 64 MB
Submit: 942  Solved: 544
[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

## 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.

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

/*

*/
#include<iostream>
#include<cstdio>
#include<cstring>

#define N 500001

using namespace std;
int a[N<<2],l,r,n,m,L,R,ans;

int main()
{
scanf("%d",&n);L=1,R=1000000;
for(int i=1;i<=n;i++)
{
scanf("%d%d",&l,&r);
a[l]++;a[r+1]--;
}
int tot=0;
for(int i=L;i<=R;i++)
{
tot+=a[i];
ans=max(ans,tot);
}
printf("%d\n",ans);
return 0;
}

posted @ 2017-08-14 20:05  安月冷  阅读(84)  评论(0编辑  收藏  举报