CodeForces - 1041D（二分）

题目

枚举每个起点，二分终点

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<queue>
#include<math.h>
#include<map>
using namespace std;
#define N 200010
#define LL long long
struct node
{
	int a, b;
}w[N];
int f[N];
int main()
{
	int n, h;
	scanf("%d%d", &n, &h);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d", &w[i].a,&w[i].b);
	}
	f[1] = w[1].a;
	for (int i = 2; i <= n; i++)
	{
		f[i] = f[i - 1] + w[i].a - w[i - 1].b;
	}
	int c, l, r, mid;
	int ans = 0, f1;
	for (int i = 1; i <= n; i++)
	{
		c = w[i].a;
		l = i, r = n + 1;
		f1 = i;
		while (l < r)
		{
			mid = (l + r) / 2;
			if (f[mid] - f[i] >= h)r = mid;
			else
			{
				f1 = mid;
				l = mid + 1;
			}
		}
		ans = max(ans, w[l-1].b - w[i].a + h - (f[l-1] - f[i]));
	}
	cout << ans << endl;
	return 0;
}