浙工大15新生赛 变换的数组

#include <iostream>
using namespace std;
int main() {
int n;
while (cin >> n && n && EOF) {
int Lu[100001], Hui[100001];
for (int i = 1; i <= n; i++) {
cin >> Lu[i];
}
for (int i = 1; i <= n; i++) {
cin >> Hui[i];
}
int flag = 1;
for (int i = 1; i <= n - 2; i++) {
if (Lu[i] != Hui[i]) {
if (Lu[i + 1] == Hui[i + 1] || Lu[i + 2] == Hui[i + 2]) {
flag = 0;
break;
}
if (Hui[i + 1] != -Lu[i + 1] || Hui[i] + Hui[i + 1] != Lu[i] || Hui[i + 2] + Hui[i + 1] != Lu[i + 2]) {
flag = 0;
break;
}
i = i + 3;
}
}
if (flag)
cout << "Yes\n";
else
cout << "No\n";
}
return 0;
}