View Code of Problem 6

#include <iostream>
using namespace std;

int main()
{
    int n,t,l[101],r[101],max,sum;
    bool flag;
    cin>>n;
    while(n--){
      flag = 1;
      cin>>t;
      for (int i = 0; i < t; i++)
      {
        scanf("%d%d",&l[i],&r[i]);
      }

      max = r[0] - l[0];
      for (int i = 0; i < t; i++)
      {
        if (r[i]-l[i]>max)
        {
          max = r[i]-l[i];
        }
      }

      sum = l[0];
      for (int i = 0; i < t-1; i++)
      {
        sum+=max;
        if (sum>l[i+1])
        {
          flag = 0;
          break;
        }
      }
      if(flag)
        printf("YES\n");
      else
        printf("NO\n");
      }
    return 0;
}

Double click to view unformatted code.


Back to problem 6