线段树写崩了 打算水一发模拟 然后卡70分了。。。。

#include<bits/stdc++.h>
#define ll long long
#define gc() getchar()
#define ull unsigned long long
using namespace std;
//const int N=1e4+100;
bool book[10001][10001],fl;
struct node
{
	int l,r,h;
} a[101];
int n;
inline bool cmp(node x ,node y)
{
	return x.h<y.h;
}


int main()
{
	cin>>n;
	ll ans=0;
	for(int i=1; i<=n; i++)
		{
			cin>>a[i].h;
			cin>>a[i].l;
			a[i].l+=1;
			cin>>a[i].r;
			a[i].r-=1;
		}
	sort (a+1,a+1+n,cmp);
	int maxh=a[n].h;

	for(int i=1; i<=n; i++)
		{
			fl=0;
			int curh=a[i].h;
			while(curh--)
				{
					if(book[a[i].l][curh]==1)//有阻挡
						{
							ans+=(a[i].h-curh);
							fl=1;
							break;
						}

				}
			if(fl==0)
				{
					ans+=a[i].h;
				}
			fl=0;
			curh=a[i].h;
			while(curh--)
				{
					if(book[a[i].r][curh]==1)//有阻挡
						{
							ans+=(a[i].h-curh);
							fl=1;
							break;
						}

				}
			if(fl==0)
				{
					ans+=a[i].h;
				}

			for(int j=a[i].l; j<=a[i].r; j++)
				{
					book[j][a[i].h]=1;
				}


		}
	cout<<ans;
	return 0;
}