题意:给出n个区间,m个机会,然后求区间连续的最大值。
思路:对区间相交的去除,注意是对左端点进行排序。然后进行尺取。,对左和右进行特判一下。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
#define fi first
#define se second
#define INF 0x3f3f3f3f3f3f3f3f
#define clr(x,y) memset(x,y,sizeof x)
const int maxn = 1e5 + 10;
const int Mod = 1e9 + 7;
const int N = 2;
/*
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
/ _||||| -:- |||||- \
| | \\\ - /// | |
| \_| ''\---/'' | |
\ .-\__ `-` ___/-. /
___`. .' /--.--\ `. . __
."" '< `.___\_<|>_/___.' >'"".
| | : `- \`.;`\ _ /`;.`/ - ` : | |
\ \ `-. \_ __\ /__ _/ .-` / /
======`-.____`-.___\_____/___.-`____.-'======
`=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
pass System Test!
*/
P a[maxn];
P b[maxn];
bool cmp(P x,P y){return x.fi < y.fi;}
int main()
{
// freopen("out.txt","r",stdin);
int n,m;
while( ~ scanf("%d%d",&n,&m))
{
for(int i = 1; i <= n; i ++)scanf("%d%d",&a[i].fi,&a[i].se);sort(a+1,a+n+1,cmp);
int last = -1;int cnt = 0;
for(int i = 1; i <= n; i++)
{
if(a[i].se <= last)continue;
if(a[i].fi <= last){b[ ++ cnt] = P(last + 1,a[i].se);last = a[i].se;}
if(a[i].fi > last){b[ ++ cnt] = P(a[i].fi,a[i].se);last = a[i].se;}
}
int l = 2,r = 2;int sum = 0,ans = 0;
while(l <= cnt)
{
while(sum <= m && r <= cnt )
{
if(sum + b[r].fi - b[r - 1].se - 1 > m)break;
sum += b[r].fi - b[r - 1].se - 1;r ++;
}
ans = max(ans,b[r - 1].se - b[l - 1].fi + 1 + m - sum);
sum -= b[l].fi - b[l - 1].se - 1;l ++;
}
//对左右进行特判
int tmp = 0;
if(cnt)b[1].se - b[1].fi + 1;
for(int i = 2; i <= cnt; i ++)
{
if(m >= b[i].fi - b[i - 1].se - 1){m -= b[i].fi - b[i - 1].se - 1;tmp += b[i].se - b[i - 1].se;}
else {tmp += m;m -= b[i].fi - b[i - 1].se - 1;break;}
}
if(m > 0)tmp += m;
ans = max(ans,tmp);
tmp = 0;
if(cnt)tmp = b[cnt].se - b[cnt].fi + 1;
for(int i = cnt - 1; i >= 1; i --)
{
if(m >= b[i + 1].fi - b[i].se - 1){m -= b[i + 1].fi - b[i].se - 1;tmp += b[i + 1].fi - b[i].fi;}
else {tmp += m;m -= b[i + 1].fi - b[i].se - 1;break;}
}
if(m > 0)tmp += m;
ans = max(ans,tmp);
printf("%d\n",ans);
}
return 0;
}