Codeforces Global Round 1 E. Magic Stones(差分数组)

#include <bits/stdc++.h>
#define ll long long
#define maxn 100005
using namespace std;
ll a[maxn], b[maxn], pre1[maxn], pre2[maxn];
int n;

int main()
{
  scanf("%d",&n);
  for(int i=1;i<=n;i++) scanf("%lld", &a[i]);
  for(int i=1;i<=n;i++) scanf("%lld", &b[i]);
  if((a[1] != b[1]) || (a[n] != b[n])){
    puts("No");
    return 0;
  }
  int pos = 0;
  for(int i=2;i<=n;i++){
    pre1[++pos] = a[i] - a[i-1];
    pre2[pos] = b[i] - b[i-1];
  }
  sort(pre1 + 1, pre1 + 1 + pos);
  sort(pre2 + 1, pre2 + 1 + pos);
  for(int i=1;i<=pos;i++){
    // cout<<pre2[i]<<endl;
    if(pre1[i] != pre2[i]){
      puts("No");
      return 0;
    }
  }
  puts("Yes");
  return 0;
}