1 solutions
-
1
#include<bits/stdc++.h> using namespace std; const int N=1010; typedef long long LL; int a[N][N]; int main() { int n,m,h; cin>>n>>m>>h; for(int i=1;i<=n;i++) { for(int j=1;j<=m;j++) { cin>>a[i][j]; } } int res=0; for(int i=1;i+2<=n;i++) { for(int j=1;j+2<=m;j++) { int minv=a[i][j],maxv=a[i][j]; int sum=0; for(int x=i;x<=i+2;x++) { for(int y=j;y<=j+2;y++) { sum+=a[x][y]; minv=min(minv,a[x][y]); maxv=max(maxv,a[x][y]); } } if(maxv-minv<=h) { res=max(res,sum); } } } cout<<res; return 0; }
- 1
Information
- ID
- 3021
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 9
- Tags
- # Submissions
- 18
- Accepted
- 2
- Uploaded By