POJ 3190(Stall Reservations 区间贪心)

最新推荐文章于 2021-10-22 19:09:06 发布

Songer_Wa

最新推荐文章于 2021-10-22 19:09:06 发布

阅读量642

点赞数 1

分类专栏：挑战程序设计竞赛文章标签： acm poj 贪心

本文链接：https://blog.csdn.net/Songer_Wa/article/details/51010448

版权

挑战程序设计竞赛专栏收录该内容

8 篇文章 0 订阅

订阅专栏

/*给出n个牛的挤奶区间
 *一头牛在那个时间必须占用一个牛棚，每个牛棚至多一头牛生产
 *问最少准备的牛棚数
 */
#include<cstdio>
#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<queue>
#include<algorithm>
#include<string>
#include<cstring>
#include<cstdlib>
#include<cctype>
#include<sstream>
#include<stack>
#include<functional>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int MAX_N = 50005;
struct P{
    int pos, first, second;
};
P interval[MAX_N];
int ans[MAX_N];
struct T{
    int lastTm, id;
    T();
    T(int a, int b):lastTm(a), id(b){}
    bool operator < (const T & a)const{
        return lastTm > a.lastTm;
    }
};
bool cmp(P a, P b){
    return a.first < b.first;
}
int N;
int main()
{
	#ifdef LOCAL
		freopen("in.txt","r",stdin);
	//	freopen("out.txt","w",stdout);
	#endif
	//ios::sync_with_stdio(false);
	while(cin >> N){
        for(int i = 0; i < N; i++){
            scanf("%d %d", &interval[i].first, &interval[i].second);
            interval[i].pos = i;
        }

        sort(interval, interval + N, cmp);
        priority_queue<T> q;
        int stallNum = 1;
        ans[interval[0].pos] = 1;
        q.push(T(interval[0].second, stallNum));
        for(int i = 1; i < N; i++){
            P cur = interval[i];
            T lst = q.top();
            if(cur.first > lst.lastTm){
                q.pop();
                q.push(T(cur.second, lst.id));
                ans[cur.pos] = lst.id;
            }
            else{
                q.push(T(cur.second, ++stallNum));
                ans[cur.pos] = stallNum;
            }
        }

        cout << stallNum << endl;
        for(int i = 0; i < N; i++)
            printf("%d\n", ans[i]);
	}
	return 0;
}