Codeforces Round #797 (Div. 3) 1690B Array Decrements Solution

                                      

 

Problem Link: https://codeforces.com/contest/1690/problem/B

Solution in C++:

///La ilaha illellahu muhammadur rasulullah

///******Bismillahir-Rahmanir-Rahim******///

///Abul Hasnat  Tonmoy

///Department of CSE,23rd batch

///Islamic University,Bangladesh

///**********ALLAH IS ALMIGHTY************///

#include <bits/stdc++.h>

using namespace std;

int main()

{

    int  n,x,y,t,r,m,i;

    cin>>t;

    while(t--)

    {

        x=y=0;

        m=INT_MIN;

        cin>>n;

        int a[n],b[n];

        for(i=0; i<n; i++)

            cin>>a[i];

        for(i=0; i<n; i++)

        {

            cin>>b[i];

            m=max(m,a[i]-b[i]);

        }

        for(i=0; i<n; i++)

        {

            if(b[i]!=0&&a[i]-b[i]!=m)

            {

                x=1;

                break;

            }

        }

        if(x==1||m<0)

            cout<<"No"<<endl;

        else

        cout<<"Yes"<<endl;

    }

}