Help me in solving TFALL problem

help
1

I need to find a failing testcase to understand problem in my code.

code :

include <bits/stdc++.h>
define int long long
using namespace std;

int32_t main() {
// your code goes here

int t;
cin>>t;

while(t--){
        int n;
        cin>>n;

        int a[n],p[n];
        for(int i=0;i<n;i++)
        cin>>a[i];
        for(int i=0;i<n;i++)
        cin>>p[i];

        int curr=0;
        for(int i=0;i<n-1;i++){
              if(p[i]>=(a[i+1]-a[i]))
                 curr=i+1;
                 else break;
        }

        if(curr==n-1){
                cout<<"YES"<<endl;
                continue;
        }
        int curr2=0;
        for(int i=1;i<n;i++){
                if(p[i]>=(a[i]-a[i-1]))
                curr2=i;
                else break;
        }
        if(curr2==n-1){
                cout<<"YES"<<endl;
                continue;
        }

        int maxcurr = max(curr,curr2);

        curr=maxcurr+1;

        for(int i=curr;i<n-1;i++){
                if(p[i]>=(a[i+1]-a[i]))
                {curr=i+1;}
                else break;
        }
        if(curr==n-1){
                cout<<"YES"<<endl;
                continue;
        }
        int end=n-1;
        for(int i=n-1;i>=curr+1;i--){
                if(p[i]>=(a[i]-a[i-1]))
                 {
                         end=i-1;
                 }
                 else break;
        }
        if(end == curr )
        {
                cout<<"YES"<<endl;

        }
        else
        cout<<"NO"<<endl;


}

return 0;

}