数组一个考点(?),差分
int c[MAXN],t[MAXN];
int solve()
{
int n;cin>>n;
rpp(i,n) cin>>c[i];
rpp(i,n) cin>>t[i];
vector<int>a,b;
if((c[1]!=t[1])||(c[n]!=t[n])) return 0;
for(int i=1;i<n;++i) a.push_back(c[i+1]-c[i]),b.push_back(t[i+1]-t[i]);
sort(all(a));sort(all(b));
rep(i,sz(a)) if(a[i]!=b[i]) return 0;
return 1;
}
signed main()
{
int T = 1;
while (T--)
{
if(solve()) cout<<"Yes\n";
else cout<<"No\n";
}
return 0;
}