问题描述：

解题思路：

找到下标从左上角到右下角的变化规律

cccf-cprz-18:2019、 

解题代码：

#include <iostream>
using namespace std;
const int EAST = 0;
const int SOUTH = 1;
const int SOUTHWEST = 2;
const int NORTHEAST = 3;
struct {int drow;int dcol;
} direct[] = {{0, 1}, {1, 0}, {1, -1}, {-1, 1}};
const int N = 500;
int a[N][N];
int main(){int n;// 输入数据cin >> n;for(int i=0; i<n; i++)for(int j=0; j<n; j++)cin >> a[i][j];// Z字形扫描，输出结果int row=0, col=0, next=EAST;cout << a[row][col];while(row != n - 1 || col != n - 1) {row += direct[next].drow;col += direct[next].dcol;cout << " " << a[row][col];if(next == EAST && row == 0)next = SOUTHWEST;else if(next == EAST && row == n - 1)next = NORTHEAST;else if(next == SOUTH && col == 0)next = NORTHEAST;else if(next == SOUTH && col == n - 1)next = SOUTHWEST;else if(next == SOUTHWEST && row == n - 1)next = EAST;else if(next == SOUTHWEST && col == 0)next = SOUTH;else if(next == NORTHEAST && col == n - 1)next = SOUTH;else if(next == NORTHEAST && row == 0)next = EAST;}cout << endl;return 0;
}