7 条题解

  • 2
    @ 2023-4-9 20:03:52 
    #include<bits/stdc++.h>

using namespace std;

int a[1001][1001],b[1001][1001]={0},i,j,maxx=INT_MIN,minx=1000000,maxy=INT_MIN,miny=INT_MAX,n;

int main(){

cin>>n;
for(i=1;i<=n;i++){
	for(j=1;j<=n;j++){
		cin>>a[i][j];
		maxx=max(maxx,a[i][j]);
		minx=min(minx,a[i][j]);
	}
	b[3][i]=maxx;
	b[4][i]=minx;
	maxx=INT_MIN;
	minx=INT_MAX;
}
for(j=1;j<=n;j++){
	for(i=1;i<=n;i++){
		maxy=max(maxy,a[i][j]);
		miny=min(miny,a[i][j]);
	}
	b[1][j]=maxy;
	b[2][j]=miny;
	maxy=INT_MIN;
	miny=INT_MAX;
}
for(i=1;i<=4;i++){
	for(j=1;j<=n;j++){
		cout<<b[i][j]<<" ";
	}
	cout<<endl;
}
return 0;
}
    • 2
      @ 2023-3-21 16:04:27 
      #include<bits/stdc++.h>

using namespace std;

int a[1001][1001],b[1001][1001]={0},i,j,maxx=INT_MIN,minx=1000000,maxy=INT_MIN,miny=INT_MAX,n;

int main(){

cin>>n;
for(i=1;i<=n;i++){
	for(j=1;j<=n;j++){
		cin>>a[i][j];
		maxx=max(maxx,a[i][j]);
		minx=min(minx,a[i][j]);
	}
	b[3][i]=maxx;
	b[4][i]=minx;
	maxx=INT_MIN;
	minx=INT_MAX;
}
for(j=1;j<=n;j++){
	for(i=1;i<=n;i++){
		maxy=max(maxy,a[i][j]);
		miny=min(miny,a[i][j]);
	}
	b[1][j]=maxy;
	b[2][j]=miny;
	maxy=INT_MIN;
	miny=INT_MAX;
}
for(i=1;i<=4;i++){
	for(j=1;j<=n;j++){
		cout<<b[i][j]<<" ";
	}
	cout<<endl;
}
return 0;
}
      • 0
        @ 2024-11-17 18:54:32 
        #include<stdio.h>
#include<iostream>
using namespace std;
int a[1000][1005];
int x[1005],b[1005],c[1005],d[1005];
int main(){
	int n;
	cin>>n;
	for(int i=1;i<=1;i++){
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
		}
	}
	for(int i=1;i<=n;i++){
		b[i]=x[i]=a[1][i];
		c[i]=d[i]=a[i][1];
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			x[j]=max(x[j],a[i][j]);
			b[j]=min(b[j],a[i][j]);
			c[i]=max(c[i],a[i][j]);
			d[i]=min(d[i],a[i][j]);
		}
	}
	for(int i=1;i<=n;i++){
		cout<<x[i]<<" ";
	}
	cout<<endl;
	for(int i=1;i<=n;i++){
		cout<<b[i]<<" ";
	}
	for(int i=1;i<=n;i++){
		cout<<c[i]<<" ";
	}
	for(int i=1;i<=n;i++){
		cout<<d[i]<<" ";
	}
	cout<<endl;
}
        • 0
          @ 2024-10-25 20:14:31

          #include<bits/stdc++.h> using namespace std; int a[1001][1001],b[1001][1001]={0},i,j,maxx=INT_MIN,minx=1000000,maxy=INT_MIN,miny=INT_MAX,n; int main(){ cin>>n; for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ cin>>a[i][j]; maxx=max(maxx,a[i][j]); minx=min(minx,a[i][j]); } b[3][i]=maxx; b[4][i]=minx; maxx=INT_MIN; minx=INT_MAX; } for(j=1;j<=n;j++){ for(i=1;i<=n;i++){ maxy=max(maxy,a[i][j]); miny=min(miny,a[i][j]); } b[1][j]=maxy; b[2][j]=miny; maxy=INT_MIN; miny=INT_MAX; } for(i=1;i<=4;i++){ for(j=1;j<=n;j++){ cout<<b[i][j]<<" "; } cout<<endl; } return 0; }

          • 0
            @ 2023-4-22 12:33:29

            AC代码

            #include<bits/stdc++.h>

using namespace std;

int a[1001][1001],b[1001][1001]={0},i,j,maxx=INT_MIN,minx=1000000,maxy=INT_MIN,miny=INT_MAX,n;

int main(){

cin>>n;
for(i=1;i<=n;i++){
	for(j=1;j<=n;j++){
		cin>>a[i][j];
		maxx=max(maxx,a[i][j]);
		minx=min(minx,a[i][j]);
	}
	b[3][i]=maxx;
	b[4][i]=minx;
	maxx=INT_MIN;
	minx=INT_MAX;
}
for(j=1;j<=n;j++){
	for(i=1;i<=n;i++){
		maxy=max(maxy,a[i][j]);
		miny=min(miny,a[i][j]);
	}
	b[1][j]=maxy;
	b[2][j]=miny;
	maxy=INT_MIN;
	miny=INT_MAX;
}
for(i=1;i<=4;i++){
	for(j=1;j<=n;j++){
		cout<<b[i][j]<<" ";
	}
	cout<<endl;
}
return 0;
//tm全家是傻逼
}
            • 0
              @ 2023-3-5 16:21:57

              #include<bits/stdc++.h> using namespace std; int a[1005][1005]; int main(){ int n; cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>a[i][j]; } } for(int i=1;i<=n;i++){ int maxn=-99999999; for(int j=1;j<=n;j++){ if(maxn<a[j][i]) maxn=a[j][i]; } cout<<maxn<<" "; } cout<<endl; for(int i=1;i<=n;i++){ int maxn=99999999; for(int j=1;j<=n;j++){ if(maxn>a[j][i]) maxn=a[j][i]; } cout<<maxn<<" "; } cout<<endl; for(int i=1;i<=n;i++){ int maxn=-99999999; for(int j=1;j<=n;j++){ if(maxn<a[i][j]) maxn=a[i][j]; } cout<<maxn<<" "; } cout<<endl; for(int i=1;i<=n;i++){ int maxn=99999999; for(int j=1;j<=n;j++){ if(maxn>a[i][j]) maxn=a[i][j]; } cout<<maxn<<" "; } return 0; }

              • -1
                @ 2022-11-24 11:42:58

                #include<bits/stdc++.h>

                using namespace std;

                int a[1001][1001],b[1001][1001]={0},i,j,maxx=INT_MIN,minx=1000000,maxy=INT_MIN,miny=INT_MAX,n;

                int main(){

                cin>>n;
for(i=1;i<=n;i++){
	for(j=1;j<=n;j++){
		cin>>a[i][j];
		maxx=max(maxx,a[i][j]);
		minx=min(minx,a[i][j]);
	}
	b[3][i]=maxx;
	b[4][i]=minx;
	maxx=INT_MIN;
	minx=INT_MAX;
}
for(j=1;j<=n;j++){
	for(i=1;i<=n;i++){
		maxy=max(maxy,a[i][j]);
		miny=min(miny,a[i][j]);
	}
	b[1][j]=maxy;
	b[2][j]=miny;
	maxy=INT_MIN;
	miny=INT_MAX;
}
for(i=1;i<=4;i++){
	for(j=1;j<=n;j++){
		cout<<b[i][j]<<" ";
	}
	cout<<endl;
}
return 0;

                }

                • 1

                矩阵行列最大值

                信息

                ID
                1058
                时间
                1000ms
                内存
                128MiB
                难度
                5
                标签
                递交数
                308
                已通过
                125
                上传者
                1. 关于
                2. 联系我们
                3. 隐私
                4. 服务条款
                5. 版权申诉
                6. Language
                7. Theme
                3. Worker 0 in 23ms
                4. Powered by Hydro v3.15.13 Community