poj 3190 Stall Reservations

Language: Default Stall Reservations Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2841 Accepted: 1015 Special Judge 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 Many answers are correct for each test dataset; a program will grade your answer. 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 1 2 3 2 4 贪心，优先队列，先对开始时间排序，队列中结束时间在前的优先。如果出队元素结束时间比另一元素早则该元素 入队，否则牛棚数加一再入队最早开始的。用一个数组记录顺序 #include<cstdio> #include<algorithm> #include<queue> #include<iostream> using namespace std; struct node { int x,y,c; friend bool operator<(node a,node b)//一定要加friend，从小到大排序 { return a.y>b.y; } }p[50005]; bool cmp(node a,node b) { return a.x<b.x; } int t[50005]; int main() { int i,j,n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d%d",&p[i].x,&p[i].y); p[i].c=i; } int r=0; sort(p,p+n,cmp); priority_queue<node>q; q.push(p[0]); t[p[0].c]=++r; for(i=1;i<n;i++) { node g=q.top(); if(g.y<p[i].x) { t[p[i].c]=t[g.c]; q.pop(); q.push(p[i]); } else { t[p[i].c]=++r; q.push(p[i]); } } printf("%d\n",r); for(int i=0;i<n;i++) printf("%d\n",t[i]); return 0; }