当前位置:网站首页>区间问题 AcWing 906. 区间分组
区间问题 AcWing 906. 区间分组
2022-07-05 06:16:00 【T_Y_F666】
区间问题 AcWing 906. 区间分组
原题链接
算法标签
贪心
思路
ans 最小组数, 即正确答案
cnt 按照如下算法所得合法方案
故ans<=cnt
证明ans>=cnt
所以 ans==cnt
代码
#include<bits/stdc++.h>
#define int long long
#define rep(i, a, b) for(int i=a;i<b;++i)
#define Rep(i, a, b) for(int i=a;i>b;--i)
using namespace std;
const int N = 100005;
inline int read(){
int s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
return s*w;
}
void put(int x) {
if(x<0) putchar('-'),x=-x;
if(x>=10) put(x/10);
putchar(x%10^48);
}
struct Sec{
int l, r;
}sec[N];
int mxr[N];
bool cmp(Sec A, Sec B){
return A.l<B.l;
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n=read();
rep(i, 0, n){
sec[i].l=read(), sec[i].r=read();
}
sort(sec, sec+n,cmp);
// 小根堆维护所有区间右端点最大值 int 区间下标 vector<int> 区间右端点
priority_queue<int, vector<int>, greater<int>> heap;
rep(i, 0, n){
// 需要开辟新区间
if(heap.empty()||heap.top()>=sec[i].l){
heap.push(sec[i].r);
}else{ // 更新当前区间右端点最大值
heap.pop();
heap.push(sec[i].r);
}
}
printf("%lld", heap.size());
return 0;
}
原创不易
转载请标明出处
如果对你有所帮助 别忘啦点赞支持哈
边栏推荐
- 阿里新成员「瓴羊」正式亮相,由阿里副总裁朋新宇带队,集结多个核心部门技术团队
- 【Rust 笔记】15-字符串与文本(下)
- Presentation of attribute value of an item
- Operator priority, one catch, no doubt
- 高斯消元 AcWing 884. 高斯消元解异或线性方程组
- Nested method, calculation attribute is not applicable, use methods
- What's wrong with this paragraph that doesn't work? (unresolved)
- 什么是套接字?Socket基本介绍
- 【LeetCode】Easy | 20. Valid parentheses
- 阿里巴巴成立企业数智服务公司“瓴羊”,聚焦企业数字化增长
猜你喜欢
Leetcode-6110: number of incremental paths in the grid graph
Arduino 控制的 RGB LED 无限镜
MySQL怎么运行的系列(八)14张图说明白MySQL事务原子性和undo日志原理
背包问题 AcWing 9. 分组背包问题
LaMDA 不可能觉醒吗?
MySQL advanced part 1: stored procedures and functions
MySQL advanced part 2: SQL optimization
[2020]GRAF: Generative Radiance Fields for 3D-Aware Image Synthesis
MySQL advanced part 2: the use of indexes
MIT-6874-Deep Learning in the Life Sciences Week 7
随机推荐
【Rust 笔记】17-并发(下)
栈 AcWing 3302. 表达式求值
2021apmcm post game Summary - edge detection
What's wrong with this paragraph that doesn't work? (unresolved)
MySQL advanced part 2: SQL optimization
Leetcode recursion
【Rust 笔记】14-集合(上)
Single chip computer engineering experience - layered idea
阿里新成员「瓴羊」正式亮相,由阿里副总裁朋新宇带队,集结多个核心部门技术团队
Regulations for network security events of vocational group in 2022 Guizhou Vocational College skill competition
Leetcode-6108: decrypt messages
Operator priority, one catch, no doubt
[rust notes] 14 set (Part 2)
927. Trisection simulation
Spark中groupByKey() 和 reduceByKey() 和combineByKey()
leetcode-6108:解密消息
[2021]IBRNet: Learning Multi-View Image-Based Rendering Qianqian
Matrixdb V4.5.0 was launched with a new mars2 storage engine!
[BMZCTF-pwn] ectf-2014 seddit
Filter the numbers and pick out even numbers from several numbers