这是一道需要处理很多细节的题目，比如输入的身高h1，h2大小判断，最后输出的保留一位小数，以及在建树中的注意的内容，要不是有前人做完指出的坑，我估计想破脑袋也想不出来。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<queue>
#define mem(a,x) memset(a,x,sizeof(a));
#define s1(x) scanf("%d",&x)
#define s2(x,y) scanf("%d%d",&x,&y);
#define s3(x,y,z) scanf("%d%d%d",&x,&y,&z);
#define s4(x,y,z,k) scanf("%d%d%d%d",&x,&y,&z,&k);
#define ls 2*rt
#define rs 2*rt+1
#define lson ls,L,mid
#define rson rs,mid+1,R
#define ll long long
using namespace std;
typedef pair<int,int> pii;
const ll inf = 0x3f3f3f3f;
/*void dis(int a[], int n){printf("总数为%d个\n",n); for(int i = 0; i < n; i++) cout<<a[i]<<", ";cout<<endl<<"------------------"<<endl;
}*/const int mx = 0;
int no[440][4400];
int n;
char str[10];
void buildy(int x,int rt, int L, int R){no[x][rt] = -1; //放错位置 if(L == R){return;}int mid = (L+R)/2;buildy(x,lson);buildy(x,rson);}
void buildx(int rt, int L, int R){buildy(rt,1,0,1000);if( L == R)return;int mid = (L+R)/2;buildx(lson);buildx(rson);
}
void inserty(int x,int rt, int L, int R, int a, int d){if(L == R){no[x][rt] = max(no[x][rt], d);return; } int mid = (L + R) / 2;if(a <= mid)inserty(x,lson,a,d);elseinserty(x,rson,a,d);no[x][rt] = max(no[x][ls],no[x][rs]); //这句不能少，与其叫做插入不如叫做更新
}
void insertx(int rt, int L, int R, int h, int a, int d){inserty(rt,1,0,1000,a,d);if(L == R)return ;int mid = (L + R) / 2;if(h <= mid)insertx(lson,h,a,d);elseinsertx(rson,h,a,d);
}
int quey(int x, int rt, int L, int R, int a, int a1){if(a <= L&& R<=a1) //写反了 return no[x][rt];int t1=-1,t2 = -1; int mid = (L + R) / 2;if(a<=mid) t1 = quey(x,lson,a,a1);if(a1 >mid) t2 = quey(x,rson,a,a1);return max(t1,t2); }
int quex(int rt, int L, int R, int h, int h1, int a, int a1){if(h <= L&& R<=h1)return quey(rt,1,0,1000,a,a1);int t1=-1,t2 = -1; int mid = (L + R) / 2;if(h<=mid) t1 = quex(lson,h,h1,a,a1);if(h1 >mid) t2 = quex(rson,h,h1,a,a1);return max(t1,t2);
}
int main(){//int T=10;//scanf("%d",&T);int h,h1,il,ia;double a,a1,l;while(s1(n) &&n){buildx(1,100,200);for(int i = 0; i < n; i++){scanf("%s",str);if(str[0] == 'I'){scanf("%d%lf%lf",&h,&a,&l);ia = a * 10;il = l *10;// cout<<"jinlai"<<endl;insertx(1,100,200,h,ia,il);}else{scanf("%d%d%lf%lf",&h,&h1,&a,&a1);int ta,ta1; //忘记交换 ta = (int)(a*10);ta1 = (int)(a1*10);if(h>h1)swap(h,h1);if(ta > ta1)swap(ta,ta1);int te = quex(1,100,200,h,h1,ta,ta1);if(te == -1){puts("-1");}elseprintf("%0.1lf\n",te/10.0);}}}return 0;
}