View Code of Problem 6

#include<iostream>
#include<algorithm>
using namespace std;
struct Trap{
	int start;
	int end;
};
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		Trap trap[n];
		for(int i=0;i<n;i++){
			scanf("%d %d",&trap[i].start,&trap[i].end);
		}
		//然后求陷阱的最大长度
		int max=0;
		for(int i=0;i<n;i++){
			if(max<(trap[i].end-trap[i].start)){
				max=trap[i].end-trap[i].start;
			}
		} 
		int flag=1;
		
		for(int i=0;i<n-1;i++){
			if((trap[i].start+max)>trap[i+1].start){
				flag=0;
				break;
			}
		}
		
		if(flag){
			cout<<"YES"<<endl;
		}else{
			cout<<"NO"<<endl; 
		}
		
		
		
	}
	return 0;
}