模拟算法,大样例全过但TLE,最后30Pts,求优化
#include <iostream>
#include <cstdio>
using namespace std;
bool a[200005];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
int k;
cin >> k;
if (k == 1)
a[i] = true;
if (k == 0)
a[i] = false;
for (int j = 1; j <= i / 2; j++) {
swap(a[j], a[i + 1 - j]);
a[j] = !a[j];
a[i + 1 - j] = !a[i + 1 - j];
}
if (i % 2 == 1) {
a[i / 2 + 1] = !a[i / 2 + 1];
}
}
for (int i = 1; i <= n; i++) {
cout << a[i] << " ";
}
return 0;
}