Z字形扫描

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<map>
#include<stack>
using namespace std;
int a[][];
int main()
{
    int n;
    cin>>n;
    for(int i=;i<n;i++)
        for(int j=;j<n;j++)
            cin>>a[i][j];
    int i=,j=,flag1=,flag2=;
    cout<<a[i][j]<<" ";
    //坑点：i,j 对应的行列搞乱了        i对应行 ，j对应列 (少用x，y)
    while()
    {
        if(i==n- && j==n-)
        {
            break;
        }
        //cout<<x<<" "<<y<<endl;
        if(flag1 == )    //考虑右移
        {
            if(j>=n-)    //不能右移，只能下移
            {
                i++;
                flag1 = ;
                cout<<a[i][j]<<" ";
            }
            else        //右移
            {
                j++;
                flag1 = ;
                cout<<a[i][j]<<" ";
            }
        }
        else if(flag1 == )    //考虑下移
        {
            if(i>=n-)
            {
                j++;
                flag1 = ;
                cout<<a[i][j]<<" ";
            }
            else
            {
                i++;
                flag1 = ;
                cout<<a[i][j]<<" ";
            }
        } 

        if(flag2 == )    //左下
        {
            while()
            {
                if(i==n-)        break;
                if(j==)        break;
                i++;
                j--;
                cout<<a[i][j]<<" ";
            }
            flag2 = ;
        }
        else if(flag2 == )    //右上
        {
            while()
            {
                if(i==)        break;
                if(j==n-)        break;
                i--;
                j++;
                cout<<a[i][j]<<" ";
            }
            flag2 = ;
        }
    }
    return ;
}