# f313-人口遷移 ```cpp #include<bits/stdc++.h> using namespace std; int main(){ int R,C,k,m,w=0; int ma=0,mi=99; int temp[100][100]; int a[100][100]; cin>>R>>C>>k>>m; for(int i=0;i<R+2;++i){ for(int j=0;j<C+2;++j){ a[i][j]=-1; temp[i][j]=0; } } for(int i=1;i<R+1;++i){ for(int j=1;j<C+1;++j){ cin>>a[i][j]; } } for(int i=0;i<m;++i){ for(int j=1;j<R+1;++j){ for(int o=1;o<C+1;++o){ if(a[j][o]!=-1){ if(a[j][o+1]!=-1){ temp[j][o+1]=temp[j][o+1]+(a[j][o]/k); w++; } if(a[j][o-1]!=-1){ temp[j][o-1]=temp[j][o-1]+(a[j][o]/k); w++; } if(a[j-1][o]!=-1){ temp[j-1][o]=temp[j-1][o]+(a[j][o]/k); w++; } if(a[j+1][o]!=-1){ temp[j+1][o]=temp[j+1][o]+(a[j][o]/k); w++; } temp[j][o]=temp[j][o]-(w*(a[j][o]/k)); w=0; } } } for(int c=1;c<R+1;++c){ for(int d=1;d<C+1;++d){ a[c][d]=a[c][d]+temp[c][d]; } } for(int x=0;x<R+2;++x){ for(int y=0;y<C+2;++y){ temp[x][y]=0; } } } for(int i=1;i<R+1;++i){ for(int j=1;j<C+1;++j){ if(a[i][j]>ma&&a[i][j]>0){ ma=a[i][j]; } if(a[i][j]<=mi&&a[i][j]>-1){ mi=a[i][j]; } } } cout<<mi<<endl<<ma; return 0; } ```
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up