#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lc p<<1
#define rc p<<1|1
const int N=60005;
struct date{
int l,r,sum,ans,tag;
}tree[N*4];
void push_up(int p)
tree[p].ans=max(tree[lc].ans,tree[rc].ans);
}
void build(int l,int r,int p){
tree[p].l=l,tree[p].r=r;
if(l==r)
return ;
int mid=(l+r)/2;
build(l,mid,lc);
build(mid+1,r,rc);
push_up(p);
}
void f(int p,int k){
tree[p].ans+=k*(tree[p].r-tree[p].l+1);
tree[p].tag+=k;
}
void push_down(int p){
f(lc,tree[p].tag);
f(rc,tree[p].tag);
tree[p].tag=0;
push_up(p);
}
void update(int l,int r,int k,int p){
if(l<=tree[p].l&&r>=tree[p].r){
tree[p].ans+=k*(tree[p].r-tree[p].l+1);
tree[p].tag+=k;
return ;
}
push_down(p);
int mid=(tree[p].l+tree[p].r)/2;
if(l<=mid)
update(l,r,k,lc);
if(r>mid)
update(l,r,k,rc);
push_up(p);
}
int query(int l,int r,int p){
if(l<=tree[p].l&&r>=tree[p].r)
return tree[p].ans;
int res=0;
push_down(p);
int mid=(tree[p].l+tree[p].r)/2;
if(l<=mid)
res=max(res,query(l,r,lc));
if(r>mid)
res=max(res,query(l,r,rc));
return res;
}
signed main(){
int c,s,r;
cin>>c>>s>>r;
build(1,c,1);
while(r--){
int o,d,n;
cin>>o>>d>>n;
if(query(o,d-1,1)+n<=s){
cout<<'T'<<'\n';
update(o,d-1,n,1);
}
else
cout<<'N'<<'\n';
}
return 0;
}
题面： P8856 [POI 2002] 火车线路 - 洛谷
只对了两个测评点，求大佬解答