View Code of Problem 6

#include <stdio.h>
using namespace std;
int main(){
	int T;
	int n;
	int l,r;
	scanf("%d", &T);
	while(T--){
		scanf("%d", &n );
		int cnt = 0; 
		int l[n],r[n];
		for( int i=0; i<n; i++ ){
			scanf("%d %d", &l[i], &r[i]);
			
		}
		int max=0;
		for( int i=0; i<n; i++ ){
			if( max < r[i] - l[i] ){
				max = r[i] - l[i];
			}
		}
		int flag = 0;
		for( int i=0; i<n-1; i++ ){
			if( l[i] +max >l[i+1]){
				flag = 1;
			}
		}
		if( flag ) printf("NO\n");
		else printf("YES\n");
	}

	return 0;
	
}

Double click to view unformatted code.


Back to problem 6