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

USACO Stall Reservations 解析

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

转载最新推荐文章于 2020-03-07 16:44:12 发布 · 51 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/Tobichi/p/9102194.html

本文解析了USACO 2006 Feb月赛 Stall Reservations 问题，该问题是关于N头牛在特定时间段内需要使用独立的牛棚进行饮水。文章提供了输入输出样例，并详细介绍了如何通过差分数组的方法来解决此问题，最终确定所需的最小牛棚数量。

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

>原题链接<

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

思路：

　　对每次修改差分，对最后差分求前缀和既是原数组，求一个max即可

代码如下

#include <cstdio>
#define max(a,b) ((a)>(b)?(a):(b))
int c[1100000];
int main() {
    int n,i,x,y,m=0,ans=0;
    scanf("%d",&n);
    for(i=1;i<=n;i++) {
        scanf("%d%d",&x,&y);
        m=max(m,y);
        c[x]++;
        c[y+1]--;
    }
    x=0;
    for(i=1;i<=m;i++) {
        x+=c[i];
        ans=max(x,ans);
    }
    printf("%d\n",ans);
}

欢迎来原博客看看 >原文链接<

转载于:https://www.cnblogs.com/Tobichi/p/9102194.html