题目链接:https://www.51nod.com/onlineJudge/questionCode.html#!problemId=1428
题意:求区间最大覆盖数,区间是左闭右开的。
思路:将区间左右点边界标记后,排个序,从小到大扫描,碰到一个左点,覆盖层加1,碰到一个右点,覆盖层减1.循环时记录最大值。
#include<cstdio>
#include<queue>
#include<iostream>
#include<vector>
#include<map>
#include<cstring>
#include<string>
#include<set>
#include<stack>
#include<algorithm>
#define cle(a) memset(a,0,sizeof(a))
#define inf(a) memset(a,ox3f,sizeof(a))
#define ll long long
#define Rep(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
const int INF = ( 2e9 ) + 2;
//const int maxn =
struct Point
{
int p,f;
};
bool cmp(Point a,Point b)
{
return a.p<b.p;
}
vector<Point> v;
int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int l,r;
scanf("%d%d",&l,&r);
v.push_back(Point{l,1});
v.push_back(Point{r,-1});
}
sort(v.begin(),v.end(),cmp);
int ans=0,c=0;
for(int i=0;i<v.size();i++)
{
if(v[i].f==1)
{
c++;
if(ans<c)ans=c;
}
else if(v[i].f==-1)
c--;
}
printf("%d\n",ans);
}