Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int n, m, a[101][101], s;
- int main()
- {
- cin>>m>>n;
- for(int i=1; i<=m; ++i)
- for(int j=1; j<=n; ++j)
- cin>>a[i][j];
- for(int i=1; i<=m; ++i)
- for(int j=1; j<=n; ++j)
- {
- int mini=11;/// stabilesc minimul dintre vecini
- if(a[i+1][j]<mini && i+1<=m) /// jos
- mini=a[i+1][j];
- if(a[i-1][j]<mini && i-1>=1) /// sus
- mini=a[i-1][j];
- if(a[i][j+1]<mini && j+1<=n) /// dreapta
- mini=a[i][j+1];
- if(a[i][j-1]<mini && j-1>=1) /// stanga
- mini=a[i][j-1];
- if(a[i][j]<mini)
- {
- s+=(mini-a[i][j]);
- a[i][j]=mini;
- }
- }
- cout<<s;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement