5 条题解

  • 0
    @ 2024-10-25 18:30:25
    #include <bits/stdc++.h>
    using namespace std;
    int a,b,c[114][114],minn,maxn,sum = 0;
    int main(){
    	cin >> a >> b;
    	for(int i = 1 ; i <= a ; i++) for(int j = 1 ; j <= b ; j++) cin >> c[i][j];
    	for(int i = 1 ; i <= a ; i++){
    		minn = 1145141919,maxn = -1145141919;
    		for(int j = 1 ; j <= b ; j++) minn = min(minn,c[i][j]);
    		for(int j = 1 ; j <= b ; j++){
    			if(c[i][j] == minn){
    				for(int k = 1 ; k <= a ; k++) maxn = max(maxn,c[k][j]);
    				if(c[i][j] == maxn){
    					sum++;
    					cout << i << " " << j << " " << c[i][j] << endl; 
    				}
    			}
    		}
    	}
    	if(sum == 0) cout << "no find\n";
    	return 0;
    }
    

    信息

    ID
    1062
    时间
    1000ms
    内存
    128MiB
    难度
    5
    标签
    递交数
    190
    已通过
    73
    上传者