#include <bits/stdc++.h>
using namespace std;
int const NMAX=300005;
int n,m;
vector<int>add[NMAX];
vector<int>del[NMAX];
void read(){
cin>>n>>m;
while(m--){
int l,r,val;
cin>>l>>r>>val;
add[l].push_back(val-l);
del[r+1].push_back(val-l);
}
}
void solve(){
multiset<int>ms;
int i;
for(i=1;i<=n;++i){
for(auto el : add[i])
ms.insert(el);
for(auto el : del[i])
ms.erase(ms.find(el));
if(ms.empty())
cout<<0<<' ';
else
cout<<*ms.rbegin()+i<<' ';
}
}
int main()
{
read();
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |