#include<iostream>
#include<cstring>
#include<cstdio>
#include<algorithm>
using namespace std;
int a[505][505];
int vis[505][505];
int n,m;
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
scanf("%d",&a[i][j]);
}
}
memset(vis,0,sizeof(vis));
int x=1,y=1;
int sum=0;
while(1){
while(y<=m&&!vis[x][y]){
vis[x][y]=1;
if(x!=1||y!=1)cout<<" ";
cout<<a[x][y];
y++;
sum++;
}
y--;
x++;
while(x<=n&&!vis[x][y]){
vis[x][y]=1;
if(x!=1||y!=1)cout<<" ";
cout<<a[x][y];
x++;
sum++;
}
x--;
y--;
while(y>=1&&!vis[x][y]){
vis[x][y]=1;
if(x!=1||y!=1)cout<<" ";
cout<<a[x][y];
y--;
sum++;
}
y++;
x--;
while(x>=1&&!vis[x][y]){
vis[x][y]=1;
if(x!=1||y!=1)cout<<" ";
cout<<a[x][y];
x--;
sum++;
}
x++;
y++;
if(sum==n*m){
break;
}
}
return 0;
}
51nod2486 小b和矩阵
最新推荐文章于 2019-08-06 15:21:14 发布