1373F - Network Coverage - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;

const int N = 1000100, mod = 998244353;

void solve(){
    int n;
    cin >> n;
    vector <int> a(n), b(n);
    for(int i = 0; i < n; ++i)
        cin >> a[i];
    for(int i = 0; i < n; ++i)
        cin >> b[i];
    long long mn = 0;
    long long cur = 0;
    for(int i = 0; i < n + n; ++i){
        cur += a[i % n];
        cur -= b[(i - 1 + n) % n];
        if(cur - mn - b[i % n] > 0){
            //cout << mn << " " << cur << " " << i << endl;
            cout << "NO\n";
            return;
        }
        mn = min(mn, cur);
    }
    if(cur > 0)
        cout << "NO\n";
    else cout << "YES\n";
}

int main(){
	cin.tie(0);
	cout.tie(0);
	ios_base::sync_with_stdio(NULL);

	int T;
	cin >> T;
	//T = 1;
	while(T--)
		solve();

	return 0;
}