AcWing 503. 借教室

#define  _CRT_SECURE_NO_WARNINGS
#pragma warning(disable:6031)
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N = 1e6 + 20;
int n, m;
int room[N];
int g[N][3];
int a[N], q[N];
int r[N];
bool check(int x)
{
	memset(r, 0, sizeof(r));//差分数组
	memset(a, 0, sizeof(a));//记数数组
	for (int i = 1; i <= x; i++)//将到第x请求的所有请求加上，对应
	{
		int d, s, t;
		d = g[i][0];;
		s = g[i][1];
		t = g[i][2];
		r[s] += d;
		r[t + 1] -= d;
	}
	for (int i = 1; i <= n; i++)//看看租借天数有没有超过我们每天提供的天数
	{
		a[i] = r[i] + a[i - 1];
	}
	for (int i = 1; i <= n; i++)
	{
		if (room[i] < a[i])return 0;
	}
	return 1;
}

void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		cin >> room[i];
	}
	for (int i = 1; i <= m; i++)
	{
		int d, s, t;
		cin >> d >> s >> t;
		g[i][0] = d;
		g[i][1] = s;
		g[i][2] = t;
		
	}
	
	int  l = 0, r = m;//l要赋值成0
	while(l < r)
	{
		int mid = (l + r + 1)>>1;//如果让r==mid，就要加一，采用上取整，l==mid，就不用加，采用下取整
		if (check(mid))l = mid;
		else {
			r = mid - 1;//根据推到，r是满足条件的数往右的第一个数
		}
	}
	if (r == m)cout << "0" << endl;
	else {
		cout << "-1" << endl;
		cout << r+1 << endl;
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	while (t--)
	{
		solve();
	}
	return 0;
}
/*这还是一道比较简单的题，遍历采用二分查照的形式，寻找最后一个不能满足订单的编号
对于check函数
采用差分法来将他统计到数组中

*/
/*战斗，爽。。。。*/