A.1 | B | C | D | E | F | G | H | I | J |
AC |
A.So I'll Max Out My Constructive Algor...
思维:情况综合,必有答案(正+逆) & 一维数组(vector)
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 70;
typedef long long ll;
void solve() {
ll n;
cin >> n;
ll h[N][N];
vector<ll> ans;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
cin >> h[i][j];
}
if (!(i & 1)) reverse(h[i] + 1, h[i] + 1 + n);
}
ll mi = 0, mx = 0;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
ans.push_back(h[i][j]);//拉直二维数组!妙且秒
}
}
for (int i = 1; i < ans.size(); i++) {
if (ans[i-1] > ans[i]) mi++;
else mx++;
}
if (mx > mi) reverse(ans.begin(), ans.end());
for (int i = 0; i < ans.size(); i++) {
cout << ans[i] << " ";
}
cout << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--) {
solve();
}
}