(POJ) 区间贪心
来源:互联网 发布:如何清空数据库 编辑:程序博客网 时间:2024/06/06 03:46
Description
Each cow is only available at some interval of times during the day for work on cleaning. Any cow that is selected for cleaning duty will work for the entirety of her interval.
Your job is to help Farmer John assign some cows to shifts so that (i) every shift has at least one cow assigned to it, and (ii) as few cows as possible are involved in cleaning. If it is not possible to assign a cow to each shift, print -1.
Input
* Lines 2..N+1: Each line contains the start and end times of the interval during which a cow can work. A cow starts work at the start time and finishes after the end time.
Output
Sample Input
3 101 73 66 10
Sample Output
2
Hint
INPUT DETAILS:
There are 3 cows and 10 shifts. Cow #1 can work shifts 1..7, cow #2 can work shifts 3..6, and cow #3 can work shifts 6..10.
OUTPUT DETAILS:
By selecting cows #1 and #3, all shifts are covered. There is no way to cover all the shifts using fewer than 2 cows.
Source
USACO 2004 December Silver
一遍过,很开心
贴个数据:
3 101 56 1010 10输出 2, 5,6是连续的
#include <iostream>
#include <algorithm>
#define MAXN 25000+10
using namespace std;
int N,T;
struct Node
{
int left,right;
} p[MAXN];
bool so(Node A,Node B)
{
if (A.left!=B.left) return A.left<B.left;
return A.right>B.right;
}
int main()
{
cin>>N>>T;
for (int i=0; i<N; i++)
{
cin>>p[i].left>>p[i].right;
}
sort(p,p+N,so);
if (p[0].left!=1)//这特判一次
{
cout<<-1<<endl;
return 0;
}
int j,R,Count=1;
for (int i=0; i<N;)
{
int Ti=0,R=p[i].right,L=p[i].left;
int r=R+1;
if (R>=T) break;
for (j=i+1;; j++) //找出在left和right区间内能跑的最远的点
{
if (p[j].left>r||j>=N) break;
if (p[j].left==L)
{
continue;
}
if (p[j].left<=r)
{
if (p[j].right>R)
{
R=p[j].right;
Ti=j;
}
}
}
Count++;
if (Ti!=0) i=Ti;
else
{
cout<<-1<<endl;
return 0;
}
}
cout<<Count<<endl;
return 0;
}
- poj 1328 区间,贪心
- (POJ) 区间贪心
- POJ 1328 区间覆盖 贪心
- poj 3069 贪心+区间问题
- poj 2376 贪心(区间覆盖)
- poj Radar Installation 【贪心 区间】
- POJ 1089 Intervals 区间覆盖+ 贪心
- poj 1089 贪心之区间覆盖问题
- poj 1716 贪心(整数区间:2-覆盖)
- poj 2376 贪心(覆盖区间)
- poj 2376 贪心 区间覆盖问题
- 课后习题 poj 2376 区间贪心
- POJ 1328 Radar Installation(区间贪心)
- POJ 3485 Highway (贪心, 区间选点)
- POJ-Radar Installation-贪心-区间选点
- poj 2376 Cleaning Shifts 贪心 区间问题
- POJ 2376 Cleaning Shifts 【贪心 区间】
- POJ 3190 Stall Reservations 【贪心 区间】
- jquery插件
- Spring之IOC—控制反转
- 【我的Java笔记】二分查找法
- JS 判断对象是否为空
- [LeetCode] Two Sum
- (POJ) 区间贪心
- Linux简单基础命令
- [模板]字符串hash
- 修改主题和样式
- Log4j的知识点以及相关报错问题解决办法
- dubbo+zookeeper
- 简单的项目上线shell脚本
- 转载-python若干小函数的使用
- Java中使用Socket实现服务器端和客户端通讯