c.cpp

在二维矩阵中找到最大值和最小值的坐标。然后再将两坐标相减到得距离

#include<cstdlib>
#include<math.h>
#include <ctime>  
#include<iostream>
#include<stdio.h>
using namespace std;

double rnd(int x){


	static double c=262147.0,t,i,r=34359738365.0/549755813888.0;
	if(x==1)r=r*c-(long)(r*c);
	else for(i=1;i<=-x;i++)r=r*c-(long)(r*c);
	return(r);
	
}


int const  row = 768; 
int const  col=567;
int count = 0;
static int array[row][col]={0};
int maxrow =array[0][0], maxcol = array[0][0], minrow=0, mincol = 0,max=0,min=0; 

void main(){
	unsigned int s;
	cout<<"输入随机数种子(1-65535):"<<endl;
	cin>>s;
	for(int i=0;i<row;i++)
		for(int j=0;j<col;j++){
			rnd(-s);
			array[i][j]=rnd(1)*256;
			cout<<array[i][j]<<" ";
			if(count++%20==0)
	    	cout<<endl;
		}
		
		
		
		for(int   l=0;   l<row;   l++)   
			for(int   k=0;   k<col;   k++)   
			{   
				if   (array[l][k]   >   max)   
				{   
					max   =   array[l][k];   
					maxrow   =   l;   
					maxcol   =   k;   
				}   
				if   (array[l][k]   <   min)   
				{   
					min   =   array[l][k];   
					minrow   =   l;   
					mincol   =   k;   
				}   
				
			}
			
			cout<<endl<<"最大值是:"<<max<<endl;
			cout<<"最小值是:"<<min<<endl;
			cout<<"距离是:"<<maxcol-mincol<<endl;
}