View Code of Problem 6

#include<stdio.h>
void main()
{
	int t, n, i;

	scanf("%d", &t);
	while(t--)
    {
        scanf("%d", &n);
        int l[n], r[n];
        int maxLength = 0;
        int begin = 0;
        int flag = 1;
        for(i=0; i<n; i++)
        {
            scanf("%d %d", &l[i], &r[i]);
            if(maxLength < r[i]-l[i])
                maxLength = r[i]-l[i];
        }
        begin = l[0];
        for(i=0; i<n-1; i++)
        {
            begin = begin + maxLength;
            if(begin>l[i+1])
            {
                flag = 0;
                break;
            }
        }
        if(flag == 1)
            printf("YES\n");
        else printf("NO\n");

    }
}