Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define ll long long
- using namespace std;
- const int e=500+7;
- ll a[e][e],dp[e][e][e];
- int main()
- {
- ll m,n,k;
- cin>>m>>n>>k;
- for(ll i=1;i<=m;i++)
- {
- for(ll j=1;j<=n;j++)
- {
- cin>>dp[0][i][j];
- }
- }
- for(ll z=1;z<=k;z++)
- {
- for(ll i=1;i<=m;i++)
- {
- for(ll j=1;j<=n;j++)
- {
- dp[z][i][j]=max(dp[z-1][i][j-1],dp[z][i][j]);
- dp[z][i][j]=max(dp[z-1][i-1][j],dp[z][i][j]);
- dp[z][i][j]=max(dp[z-1][i][j+1],dp[z][i][j]);
- dp[z][i][j]=max(dp[z-1][i+1][j],dp[z][i][j]);
- }
- }
- }
- /*for(ll i=1;i<=m;i++)
- {
- for(ll j=1;j<=n;j++)
- {
- for(ll z=1;z<=k;z++)
- {
- dp[i][j][z]=max(dp[i][j][z],a[i][j]);
- dp[i][j][z]=max(dp[i-1][j][z-1],dp[i][j][z]);
- dp[i][j][z]=max(dp[i][j-1][z-1],dp[i][j][z]);
- dp[i][j][z]=max(dp[i][j+1][z-1],dp[i][j][z]);
- dp[i][j][z]=max(dp[i+1][j][z-1],dp[i][j][z]);
- }
- }
- }*/
- for(ll i=1;i<=m;i++)
- {
- for(ll j=1;j<=n;j++)
- {
- cout<<dp[k][i][j]<<" ";
- //cout<<a[i][j]<<" ";
- }
- cout<<"\n";
- }
- }
- /*
- 6 6 2
- 6 0 0 0 0 7
- 0 2 0 0 3 0
- 0 0 0 0 0 0
- 0 0 0 0 0 0
- 0 5 0 0 4 0
- 9 0 0 0 0 8
- */
- /*
- 6 6 6 7 7 7
- 6 6 3 3 7 7
- 6 5 2 3 4 7
- 9 5 5 4 4 8
- 9 9 5 5 8 8
- 9 9 9 8 8 8
- */
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement