P1083 [NOIP2012 提高组] 借教室

#include<iostream>
#include<algorithm>
//#include<queue>
//#include <stack>
#include<string.h>
//#include <stdlib.h>
//#include <cstdio>
//#include<vector>
//#include "time.h"
//#include<math.h>
//#include <iomanip>
using namespace std;
typedef long long ll;
const int N = 1e6;
ll m, n;
ll v[N];//数值
ll s[N];//左
ll t[N];//右
ll r[N];//实际能提供的教室数数组
ll num[N];//满足题给订单条件理论上需要的教室数的数组
ll d[N];//差分数组
bool check(int x)
{
	//检查前先把数组清空，避免之前的运算对下一次造成影响
	memset(num, 0, sizeof(num));
	memset(d, 0, sizeof(d));
	//求差分数组
	for (int i = 1; i <= x; ++i)
	{
		d[s[i]] += v[i];
		d[t[i]+1] -= v[i];
	}
	for (int i = 1; i < n; i++)d[i] += d[i - 1];
	//求理论值并比较
	for (int i = 1; i <= n; i++)
	{
		num[i] += d[i];
		//如果理论值大于实际值则说明教室不够
		if (num[i] > r[i])return false;
	}
	return true;
}
int find()
{
	int l = 1 - 1; int r = 1e6 + 1;
	while (l + 1 < r)
	{
		int mid = l + (r - l) / 2;
		if (check(mid))l = mid;
		else r = mid;
	}
	return l;
}
int main()
{
	
	cin >> n >> m;
	for (int i = 1; i <= n; i++)cin >> r[i];
	for (int i = 1; i <= m; i++)cin >> v[i] >> s[i] >> t[i];
	//如果所有订单均可满足
	if (check(m))cout << 0;
	else
	//否则
	cout << -1 << endl << find()+1;//+1是因为find()返回的是能满足条件的最大的订单数，从下一个起就不满足了，所以要+1
	return 0;
}