View Code of Problem 6

#include <stdio.h>
int main()
{
	int t,n,i,r[50000],l[50000],flag,max=0;
	printf("input t:\n");
	scanf("%d",&t);
	while(t--)
	{
		flag=1;
		printf("input n:");
		scanf("%d",&n);
		for(i=0;i<n;i++)
		{
			printf("input l and r(0<=l<=r<=50000)");
			scanf("%d %d",&l[i],&r[i]);
		}
			for(i=0;i<n;i++)
		{
			if(r[i]-l[i]>max)
				max=r[i]-l[i];
		}
		for(i=0;i<n-1;i++)
		{
			if((l[i]+max)>l[i+1])
				flag=0;
			else
				flag=1;
		}
		if(flag==0)
			printf("NO!");
		else
			printf("YES!");
	}
}