Final Array

#include <iostream>
#include <queue>
#include <utility>
using namespace std;
using ll = long long;
const ll MOD = (int)1e9 + 7;

const int N = 1e5;
vector<pair<int, int>> ques[N];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; ++i) {
		int a, b, x;
		cin >> a >> b >> x;
		--a; --b;
		ques[a].push_back({x-a, b});
	}

	priority_queue<pair<int, int>> que;
	for (int i = 0; i < n; ++i) {
		for (auto pr : ques[i]) {
			que.push(pr);
		}
		while((! que.empty()) && (que.top().second < i)) que.pop();

		int ans = -i;
		if (! que.empty()) ans = max(ans, que.top().first);
		cout << ans + i << ' ';
	}
	cout << '\n';
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED