CF 1110E

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 const int N = 1e5 + 10;
 4 int a[N],b[N];
 5 vector<int>v1, v2;
 6 int main(){
 7     int n;scanf("%d",&n);
 8     for(int i = 1 ; i <= n ; i++){
 9         scanf("%d",&a[i]);
10     }
11     for(int i = 1 ; i <= n ; i++){
12         scanf("%d",&b[i]);
13     }
14     for(int i = 2 ; i <= n ; i++){
15         v1.push_back(a[i] - a[i - 1]);
16         v2.push_back(b[i] - b[i - 1]);
17     }
18     sort(v1.begin(), v1.end());
19     sort(v2.begin(), v2.end());
20     
21     if(v1 == v2 && a[1] == b[1]){
22         printf("Yes\n");
23     }else{
24         printf("No\n");
25     }
26     
27     return 0;
28 }